valley-k-small
Theory Center

Unified Mathematical Map

The cards below summarize shared mathematical notions across reports and map each notion to concrete report pages.

Goal: keep the mathematics continuous from notation to derivation, then to evidence and cross-report verification.

Reading Protocol

  1. Start from Chapter 0/1 in Book for notation and core FPT objects. /book
  2. Use concept cards below to locate every notion in concrete reports.
  3. Inspect stage matrix and claim ledger to verify model/method/result/finding continuity.
  4. Use duplication governance to distinguish shared foundations from harmful repetition.

Theory cards 6 Claims 130 Book chapters 8

Continuity Spine

Acts define the long-form argument structure, and chapter spine transitions show how one verified block feeds the next.

Open chapter transitions
  • Chapter 0: Reading Guide & Notation: Carry notation and verified claims from Chapter 0: Reading Guide & Notation into Chapter 1: Core FPT Concepts, then extend mechanism and evidence without resetting assumptions.
  • Chapter 1: Core FPT Concepts: Carry notation and verified claims from Chapter 1: Core FPT Concepts into Chapter 2: Grid2D Family, then extend mechanism and evidence without resetting assumptions.
  • Chapter 2: Grid2D Family: Bridge note: keep the same hazard/survival diagnostics from Grid2D, then switch geometry to ring so shortcut and lazy parameters can be isolated without boundary-shape confounders.
  • Chapter 3: Ring Family Baseline: Carry notation and verified claims from Chapter 3: Ring Family Baseline into Chapter 4: Shortcut Variants, then extend mechanism and evidence without resetting assumptions.
  • Chapter 4: Shortcut Variants: Carry notation and verified claims from Chapter 4: Shortcut Variants into Chapter 5: Cross-Model Synthesis, then extend mechanism and evidence without resetting assumptions.
  • Chapter 5: Cross-Model Synthesis: Before any new claims are added, move from synthesis to reproducibility gates and verify command-, schema-, and artifact-level closure.
  • Chapter 6: Reproducibility & Validation: Only unresolved items that pass reproducibility constraints should enter the outlook as auditable hypotheses.
  • Chapter 7: Outlook & Open Questions: No downstream chapter; consolidate assumptions, claims, and open questions.

Concept Cards

First-passage distribution

Core PMF/CDF/survival quantities used across the major report families.

Reports: 26

Show all linked reports

Notation & Term Lock

These locked terms keep CN/EN semantics aligned and provide formula anchors for quick lookup.

AW Inversion

Discrete Cauchy/FFT-based inversion from generating functions to time-domain FPT quantities.

ft≈FFT(F(zk))f_t \approx FFT(F(z_k))

method Reports 14

Beta Scan

Parameter sweep over shortcut strength β to identify phase shifts and regime boundaries.

β∈[0,1]β ∈ [0,1]

parameter Reports 14

Bimodality Criterion

Operational criterion to separate true two-peak structure from noisy shoulders.

peak−valley−peakconsistencypeak-valley-peak consistency

diagnostic Reports 14

Claim Ledger

Structured mapping from statement to evidence paths and cross-report links.

claim−>evidence−>linkedreportsclaim -> evidence -> linked reports

workflow Reports 14

Equal4 Baseline

Four-way equalized baseline used to compare shortcut effects under symmetric local movement.

p(±1)=p(±2)p(±1)=p(±2)

shortcut-variant Reports 14

First-Passage Time (FPT)

Random time needed for the trajectory to hit an absorbing target for the first time.

f(t)f(t)

core-metric Reports 14

Hazard Rate

Conditional probability of first passage at step t given survival up to t.

h(t)=f(t)/S(t−1)h(t)=f(t)/S(t-1)

core-metric Reports 14

Renormalize Shortcut Mode

Base transition weights are rescaled after shortcut injection to preserve normalization constraints.

pi′=c⋅pip_i' = c · p_i

shortcut-variant Reports 14

Selfloop Shortcut Mode

Shortcut probability mass is taken from self-loop probability without renormalizing other moves.

pstay−>pstay−βp_stay -> p_stay-β

shortcut-variant Reports 14

Survival Function

Probability that first passage has not happened by step t.

S(t)=P(T>t)S(t)=P(T>t)

core-metric Reports 14

AW inversion

Discrete Cauchy / FFT inversion from generating functions.

theory-card Reports 11

Beta / shortcut scan

How shortcut strength changes bimodality and phase behavior.

theory-card Reports 13

Stage Coverage Matrix

Each row tracks whether one report closes the full chain from assumptions to findings.

ReportModelMethodResultFindingClaimsFormulasBook
Cross-Model Luca Regime Map111251chapter-5-cross-model-synthesis
Reflecting Encounter Mean Validation111251chapter-6-repro-validation
Grid2D Bimodality Baseline1112514chapter-0-reading-guide
Grid2D Blackboard Endpoint Case111258chapter-2-grid2d-family
Grid2D Membrane Near Target111251chapter-6-repro-validation
Grid2D One Target — Base111251chapter-6-repro-validation
Grid2D One Target — Window Measures111251chapter-6-repro-validation
Grid2D One vs Two Target — Gating111251chapter-6-repro-validation
Grid2D Rectangle Bimodality111251chapter-2-grid2d-family
Grid2D Reflecting-Boundary Bimodality1112514chapter-2-grid2d-family
Grid2D Two-Target Bias-Radius Scaffold111251chapter-6-repro-validation
Grid2D Two-Target Double-Peak111251chapter-1-core-fpt
2D Two-Walker Encounter With Shortcut111251chapter-6-repro-validation
Ring Derivation Backbone1112514chapter-0-reading-guide
Lazy Ring Flux Baseline111252chapter-1-core-fpt
Lazy Ring Jump-Over Mechanism (K2 vs K4)111251chapter-3-ring-baseline
Lazy Ring Shortcut Beta Scan111251chapter-4-shortcut-variants
Lazy Ring Shortcut Figure-1 Revision111251chapter-4-shortcut-variants
Two-Target Lazy Ring Mechanics111251chapter-0-reading-guide
1D Ring Two-Walker Encounter With Shortcut111251chapter-6-repro-validation
Ring Valley Regime Map111256chapter-3-ring-baseline
Destination-Scan Valley Control111251chapter-4-shortcut-variants
Reflecting Encounter Diagonal Decomposition111141chapter-6-repro-validation
Exact Recursion — Method Guide111141chapter-6-repro-validation
Final Multitimescale FPT and Encounter Report1111410chapter-6-repro-validation
Grid2D One Target — Exit Timing111141chapter-6-repro-validation
Grid2D One Target — Valley/Peak Budget111141chapter-6-repro-validation

Formula Depth Governance

Thresholds are applied by report family so lightweight notes are explicit exceptions instead of silent gaps.

Notion → Claim → Evidence

First-passage distribution

Core PMF/CDF/survival quantities used across the major report families.

  • Model ring_valley (evidence 5)
    The graph is a directed-shortcut ring with uniform K-neighbor transitions and an absorbing target at N/2, using paper-consistent indexing and shortcut…
  • Model ring_deriv_k2 (evidence 4)
    The setting is a finite ring random walk with periodic indexing and one directed long-range connection, expressed in a form compatible with both lazy-…
  • Model grid2d_bimodality (evidence 4)
    The model is a two-dimensional N×N lattice with an absorbing target, anisotropic drift controls, and lazy waiting probability under explicit boundary…
  • Model grid2d_reflecting_bimodality (evidence 4)
    The model keeps a reflecting 2D lattice with absorbing target and controlled local transport structures (detours, pores, tracks).
  • Model grid2d_blackboard_bimodality (evidence 4)
    The model keeps reflecting-boundary lattice dynamics and evaluates endpoint wall geometry where corridor shortcuts are strongly constrained.

Survival and hazard

Links between f(t), S(t), and hazard-style diagnostics.

  • Model ring_valley (evidence 5)
    The graph is a directed-shortcut ring with uniform K-neighbor transitions and an absorbing target at N/2, using paper-consistent indexing and shortcut…
  • Model grid2d_reflecting_bimodality (evidence 4)
    The model keeps a reflecting 2D lattice with absorbing target and controlled local transport structures (detours, pores, tracks).
  • Model ring_lazy_jump (evidence 3)
    A lazy ring with one directed shortcut is used as the baseline setting, with matched parameters across K=2 and K=4 to isolate neighborhood effects.
  • Model ring_lazy_jump_ext (evidence 3)
    The model keeps the lazy ring baseline with one directed shortcut under the selfloop probability rule, and compares K=2 versus K=4 under matched param…
  • Model ring_valley_dst (evidence 3)
    The model uses a K=6 ring with one directed shortcut src->dst and an absorbing target;…

Hazard interpretation

Peak/valley interpretation using hazard dynamics.

  • Model ring_valley (evidence 5)
    The graph is a directed-shortcut ring with uniform K-neighbor transitions and an absorbing target at N/2, using paper-consistent indexing and shortcut…
  • Model grid2d_reflecting_bimodality (evidence 4)
    The model keeps a reflecting 2D lattice with absorbing target and controlled local transport structures (detours, pores, tracks).
  • Model ring_lazy_jump (evidence 3)
    A lazy ring with one directed shortcut is used as the baseline setting, with matched parameters across K=2 and K=4 to isolate neighborhood effects.
  • Model ring_lazy_jump_ext (evidence 3)
    The model keeps the lazy ring baseline with one directed shortcut under the selfloop probability rule, and compares K=2 versus K=4 under matched param…
  • Model ring_valley_dst (evidence 3)
    The model uses a K=6 ring with one directed shortcut src->dst and an absorbing target;…

Beta / shortcut scan

How shortcut strength changes bimodality and phase behavior.

  • Model ring_valley (evidence 5)
    The graph is a directed-shortcut ring with uniform K-neighbor transitions and an absorbing target at N/2, using paper-consistent indexing and shortcut…
  • Model ring_deriv_k2 (evidence 4)
    The setting is a finite ring random walk with periodic indexing and one directed long-range connection, expressed in a form compatible with both lazy-…
  • Model grid2d_reflecting_bimodality (evidence 4)
    The model keeps a reflecting 2D lattice with absorbing target and controlled local transport structures (detours, pores, tracks).
  • Model grid2d_blackboard_bimodality (evidence 4)
    The model keeps reflecting-boundary lattice dynamics and evaluates endpoint wall geometry where corridor shortcuts are strongly constrained.
  • Model ring_lazy_jump (evidence 3)
    A lazy ring with one directed shortcut is used as the baseline setting, with matched parameters across K=2 and K=4 to isolate neighborhood effects.

Spectral decomposition

Eigenvalue / resolvent based derivations.

  • Model ring_deriv_k2 (evidence 4)
    The setting is a finite ring random walk with periodic indexing and one directed long-range connection, expressed in a form compatible with both lazy-…
  • Model grid2d_bimodality (evidence 4)
    The model is a two-dimensional N×N lattice with an absorbing target, anisotropic drift controls, and lazy waiting probability under explicit boundary…
  • Model grid2d_reflecting_bimodality (evidence 4)
    The model keeps a reflecting 2D lattice with absorbing target and controlled local transport structures (detours, pores, tracks).
  • Method ring_deriv_k2 (evidence 5)
    The report derives Green-function style propagators, constructs defect-resolvent corrections, and obtains first-passage generating forms that can be n…
  • Method grid2d_bimodality (evidence 5)
    The method links defect-free and defect-corrected propagators to generating-function inversion, then validates candidate regimes through parameter sca…

AW inversion

Discrete Cauchy / FFT inversion from generating functions.

  • Model ring_valley (evidence 5)
    The graph is a directed-shortcut ring with uniform K-neighbor transitions and an absorbing target at N/2, using paper-consistent indexing and shortcut…
  • Model ring_deriv_k2 (evidence 4)
    The setting is a finite ring random walk with periodic indexing and one directed long-range connection, expressed in a form compatible with both lazy-…
  • Model grid2d_bimodality (evidence 4)
    The model is a two-dimensional N×N lattice with an absorbing target, anisotropic drift controls, and lazy waiting probability under explicit boundary…
  • Model grid2d_reflecting_bimodality (evidence 4)
    The model keeps a reflecting 2D lattice with absorbing target and controlled local transport structures (detours, pores, tracks).
  • Model final_multitimescale_fpt_encounter (evidence 4)
    Walker (i) has mobility (q i (0,1]). At an interior site, the walker moves left/right with probabilities and stays with probability (1-q i).

Duplication Governance

Shared Foundations

Count: 8

  • f(t)=\Pr[T=t],\quad S(t)=\Pr[T>t],\quad h(t)=\frac{f(t)}{S(t-1)} (0)
  • \begin{aligned} p_{\text{left}} &= \frac{q}{4}(1+g_x),\quad p_{\text{right}} = \frac{q}{4}(1-g_x),\\ p_{\text{down}} &=… (0)
  • \Delta=\delta p_{\text{stay}} (0)
  • q_{\text{site}}=\text{factor}\cdot q (0)
  • A_{v,u}=\Pr(u\to v) (0)
  • \mathbf{p}_{t+1}=A\mathbf{p}_t (0)

Redundant Duplicates

Count: 1

  • f(t)=\Pr[T=t] (0)

Consistency Checks

Cross-Report Routes

These routes stitch reports into continuous tracks instead of isolated pages.

Content-Level Arcs

grid2d progression

grid2d track links 13 reports into one continuous argument.

Checkpoints: 13 Claims: 63

Open checkpoints
  1. Grid2D Bimodality Baseline
  2. Grid2D Reflecting-Boundary Bimodality
  3. Grid2D Blackboard Endpoint Case
  4. Grid2D Two-Target Double-Peak
  5. 2D Two-Walker Encounter With Shortcut
  6. Grid2D Rectangle Bimodality
  7. Grid2D Membrane Near Target
  8. Grid2D One Target — Base
  9. Grid2D One Target — Exit Timing
  10. Grid2D One Target — Valley/Peak Budget
  11. Grid2D One Target — Window Measures
  12. Grid2D One vs Two Target — Gating
  13. Grid2D Two-Target Bias-Radius Scaffold

cross progression

cross track links 1 reports into one continuous argument.

Checkpoints: 1 Claims: 5

Open checkpoints
  1. Cross-Model Luca Regime Map

Grid and ring mechanisms converge into cross-report synthesis.

Global storyline that connects all report families from mechanism to synthesis.

Checkpoints: 27 Claims: 130

Open checkpoints
  1. Lazy Ring Jump-Over Mechanism (K2 vs K4)
  2. Lazy Ring Shortcut Beta Scan
  3. Lazy Ring Shortcut Figure-1 Revision
  4. Lazy Ring Flux Baseline
  5. Ring Valley Regime Map
  6. Destination-Scan Valley Control
  7. Ring Derivation Backbone
  8. Two-Target Lazy Ring Mechanics
  9. 1D Ring Two-Walker Encounter With Shortcut
  10. Grid2D Bimodality Baseline
  11. Grid2D Reflecting-Boundary Bimodality
  12. Grid2D Blackboard Endpoint Case
  13. Grid2D Two-Target Double-Peak
  14. 2D Two-Walker Encounter With Shortcut
  15. Grid2D Rectangle Bimodality
  16. Grid2D Membrane Near Target
  17. Grid2D One Target — Base
  18. Grid2D One Target — Exit Timing
  19. Grid2D One Target — Valley/Peak Budget
  20. Grid2D One Target — Window Measures
  21. Grid2D One vs Two Target — Gating
  22. Grid2D Two-Target Bias-Radius Scaffold
  23. Cross-Model Luca Regime Map
  24. Final Multitimescale FPT and Encounter Report
  25. Exact Recursion — Method Guide
  26. Reflecting Encounter Diagonal Decomposition
  27. Reflecting Encounter Mean Validation