Pith. sign in

REVIEW 3 major objections 5 minor 3 cited by

For a large Markovian network, the first-passage time distribution is generically either a delta or an exponential, and the eigenvalue spectrum of the generator decides which one.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

T0 review · deepseek-v4-flash

2026-08-02 21:58 UTC pith:2HQHS3V3

load-bearing objection A solid spectral-graph analysis of FPT limits for r=0 networks, but the 'generic' claim outruns the proof for finite r; the reversible exponential theorem is the strongest part. the 3 major comments →

arxiv 2602.18265 v3 pith:2HQHS3V3 submitted 2026-02-20 cond-mat.stat-mech physics.bio-phq-bio.MN

Emergence of generic first-passage time distributions for large Markovian networks

Julian B. Voits , Ulrich S. Schwarz (Heidelberg University) This is my paper
classification cond-mat.stat-mech physics.bio-phq-bio.MN PACS 05.40.-a02.50.Ga
keywords first-passage timesMarkovian networksmaster equationkinetic proofreadingeigenvalue spectrummatrix-tree theoremspanning forestsuniversality
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper tries to prove a universality statement: for a Markovian network with many states, the time to first reach a target state, rescaled by its mean, can converge to only one of two shapes—a memoryless exponential or a sharp deterministic peak—provided the walk starts macroscopically far from the target. The deciding quantity is the spectrum of the generator matrix: a single dominant inverse eigenvalue produces the exponential, while infinitely many comparable inverse eigenvalues produce the delta. The proof connects first-passage moments to spanning-tree and spanning-forest weights and reduces the scaled cumulants to ratios of inverse-eigenvalue sums. If true, this explains why complex biochemical decision networks show simple coarse-grained completion-time statistics, and it shows that the deterministic and exponential limits are not symmetric mirror images.

Core claim

On the paper's own terms, the central discovery is Eq. (31): under the macroscopic forest condition, the n-th cumulant of the first-passage time divided by its mean equals (n-1)! times the ratio of the n-th inverse-eigenvalue sum to the first inverse-eigenvalue sum raised to the n-th power. If the dominant inverse eigenvalue absorbs the entire trace of the inverse generator, all normalized cumulants approach (n-1)!, the exponential's cumulants. If instead infinitely many inverse eigenvalues contribute comparably, the variance ratio vanishes and the distribution collapses to a delta. The paper also establishes that, for reversible networks, a vanishing ratio of reverse to forward mean first-p

What carries the argument

The key object is the matrix M = (-K^T)^(-1), where K is the generator of the process restricted to non-target states; its entries are ratios of weighted two-tree spanning forests, and its trace is the sum of inverse eigenvalues. The macroscopic forest condition—that the ratio r of forest weights with the starting vertex on the target-rooted tree versus the complementary tree stays finite—guarantees that the mean first-passage time scales as the trace of M. The cumulant formula Eq. (31) then transfers the problem from dynamics to spectral geometry, and, for reversible networks, the interlacing of eigenvalues of principal minors converts a backward-bias condition into single-eigenvalue domina

Load-bearing premise

The load-bearing assumption is that the initial state is macroscopically far from the target, formalized by the macroscopic forest condition: the ratio of two-tree spanning-forest weights with the start on the target tree versus the other tree must stay finite as the network grows; if the process starts too close to the target, local structure dominates and no universal limit is guaranteed.

What would settle it

Take a family of reversible one-step master equations with rates chosen so that the macroscopic forest condition holds but the eigenvalue-dominance ratio R = λ1^(-1)/Σλ_i^(-1) approaches a limit strictly between 0 and 1 as N grows, then numerically compute the normalized first-passage cumulants. Eq. (31) predicts they converge to a non-exponential, non-delta form; if instead the distribution becomes exactly exponential or exactly delta for all such families, the spectral-sum formula is wrong.

Watch this falsifier — get emailed when new claim-graph text bears on it.

If this is right

  • For kinetic proofreading and other large biochemical networks, observed delta or exponential completion-time distributions follow from the eigenspectrum, not from model-specific rate choices.
  • Reversible networks with a strong backward bias relative to the target are guaranteed to show exponential first-passage times if the macroscopic forest condition holds; one-parameter coarse-grained Markov models are then statistically sufficient.
  • Strongly connected networks with locally bounded rates and non-vanishing conductance have deterministic completion times once the mean first-passage time diverges.
  • A global forward bias is not enough for determinism; the relevant structural quantities are spectral, so bias criteria based on averages of forward-backward ratios can mislead.
  • Irreversible networks with backward bias can break both universal limits, e.g., through convolutions of exponentials across metastable clusters, so irreversible bottleneck transitions need separate treatment.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Eq. (31) suggests a cheap pre-simulation diagnostic: compute R = λ1^(-1)/Σλ_i^(-1) from the rate matrix; R approaching 1 predicts exponential statistics, while R approaching 0 predicts deterministic statistics.
  • The normalized cumulants offer a sharper experimental signature than the coefficient of variation; measuring third and fourth cumulants of single-molecule first-passage times could distinguish a true exponential from other unit-CV distributions.
  • The asymmetry between the two limits hints at an information-theoretic ordering: the exponential (max-entropy) regime is easily reached by reversible dynamics, while the delta (min-entropy) regime requires stronger dissipative or conductance structure.
  • The non-generic irreversible case suggests a path to classification via metastable clustering: networks with multiple macroscopic almost-invariant components should produce phase-type limits that are convex combinations or convolutions of exponentials.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. The paper studies the large-N limit of first-passage time (FPT) distributions for continuous-time Markovian networks with a single absorbing target. It uses a graph-theoretic representation of the inverse generator to express the cumulants of the FPT normalized by its mean in terms of sums of inverse eigenvalues of the generator's principal minor, under a 'macroscopic forest condition' defined by a finite limit r of a ratio of two-tree spanning-forest weights (Eq. 24). The main claim is that the limiting FPT distribution is exponential when one inverse eigenvalue dominates the spectral sum, and deterministic (delta) when infinitely many eigenvalues contribute comparably. The paper derives a cumulant formula (Eq. 31) for r=0, gives sufficient conditions for the deterministic limit via conductance and mean residual life, proves a reversible-network backward-bias condition for the exponential limit, presents a counterexample to naive bias intuition (Sec. III E), and supports the theory with Gillespie simulations on random networks.

Significance. If the classification were established as stated, it would provide a spectral explanation for the emergence of delta and exponential FPT regimes in complex biochemical networks, unifying earlier kinetic-proofreading observations. The graph-theoretic approach is elegant and yields explicit, parameter-free conditions. The paper contains genuine strengths: the exponential-limit proof under r=0 and reversibility (Supplement IV) is carefully argued, the counterexample in Sec. III E is instructive, and the authors provide reproducible simulation code and data. However, the central cumulant formula is only proven for r=0, whereas the macroscopic forest condition is r<∞, and this gap currently limits the generality of the paper's main claims.

major comments (3)
  1. [§III B, Eqs. (24), (27), (30), (31)] The cumulant formula (31) is derived only after setting r=0 in Eq. (30). For 0<r<∞, the term ln(Σ_{n=0} r_n s^n) in Eq. (27) does not vanish: r_1=r>0, and the recurrence in Supplement II allows non-vanishing higher r_n. This logarithmic term contributes to every cumulant of t/⟨τ_m⟩. Consequently, eigenvalue delocalization (Σ_i λ_i^{-2}/(Σ_i λ_i^{-1})^2→0) does not by itself force κ_2→0, and eigenvalue concentration (λ_1^{-1}/Σ_i λ_i^{-1}→1) does not by itself force κ_n→(n-1)!. Since the macroscopic forest condition is defined as r<∞ (Eq. 24), the main delta/exponential classification is not established under that condition. The authors need either to prove r→0 for the relevant large-N ensembles, or to extend Eq. (31) by controlling the forest-polynomial contributions for finite r.
  2. [§III B, Eqs. (23) and (25)] These equations contain a dimensional/typographical error. The correct relation between the mean FPT and the trace of M is ⟨τ_m⟩/(Σ_i λ_i^{-1}) = 1/(1+r), not '1 − ⟨τ_m⟩Σ_i λ_i^{-1}' as printed. As written, Eq. (23) has a dimensionless left-hand side while the right-hand side has units of time squared (unless rates are artificially dimensionless, which the graph-theoretic weights show they are not). Eq. (25) is therefore not a valid equivalence. The same problem appears in Supplement II, Eq. (S2.4). Please correct these identities and re-examine the derivation of Eq. (31).
  3. [§III C, Eqs. (33)–(35)] The conductance argument for the deterministic limit is not rigorously controlled. The Cheeger/Lawler–Sokal bound applies to the generator of an irreducible Markov chain, whereas the relevant object is the principal minor K with an absorbing target. The paper proposes to introduce a small back-rate ε and then let ε→0, but it does not prove that the spectral gap of the ε-perturbed irreducible generator converges to the smallest eigenvalue of K, nor that the ε→0 and N→∞ limits commute. Since this argument is used as the general proof of the deterministic-limit eigenvalue condition, the theorem as stated is incomplete.
minor comments (5)
  1. [§III B, Eq. (26)] The notation p_{m→{j,N}}(N) is confusing: the argument N is overloaded (system size vs. target vertex). Please define it more explicitly.
  2. [§III D] The sentence 'this criterion becomes sufficient' refers to the coefficient of variation converging to 1. Please clarify that sufficiency holds only under the r=0 macroscopic forest condition, as the subsequent proof assumes.
  3. [§III F] Typo: 'behavoir' should be 'behavior'. Also in the caption of Fig. 7(c), 'eigenvalue ratio (histogram)' should likely read 'box plot'.
  4. [Supplement V] Typo: 'expondistributed' should be 'exponentially distributed'.
  5. [Supplement VI] Typo: 'approriate' should be 'appropriate'.

Circularity Check

0 steps flagged

No significant circularity: the central derivation is conditional on explicit hypotheses and does not fit or define its conclusions into existence.

full rationale

The paper's derivation chain is not circular. The central cumulant identity Eq. (31) is derived from the graph-theoretic Laplace representation under the explicitly stated hypothesis r = 0 (Eqs. 29-30), and both limiting regimes are then analyzed under separate sufficient conditions: the deterministic limit via Eq. (32) and the exponential limit via Eq. (44) or the backward-bias condition (47). These hypotheses are not redefinitions of the target conclusions; the macroscopic forest condition r < ∞ is a structural precondition, not a restatement of delta/exponential convergence. No parameter is fitted to first-passage data and then presented as a prediction: the random-network tests compare independently simulated FPT histograms with numerically computed eigenvalue ratios, and the graph-generation procedure cited from the authors' prior work [70] is used for illustration only, not as an input to the theorems. The exponential-limit proof relies on external interlacing results (Cauchy interlacing, Fisk), not on a self-citation. The skeptic's concern that Eq. (31) is only established for r = 0 while the macroscopic forest condition allows finite r is a proof-generality caveat, not a circular reduction: it identifies a possible missing r → 0 argument for generic ensembles, but it does not exhibit an equation that assumes its own conclusion. Self-citations [70,95,100,101] are non-load-bearing for the main mathematical results. Therefore no circular step is present.

Axiom & Free-Parameter Ledger

0 free parameters · 7 axioms · 0 invented entities

The paper introduces no fitted parameters and no new physical entities. The main theoretical load is carried by standard results (matrix-tree, Perron-Frobenius, Cheeger, interlacing) plus the paper's own macroscopic forest condition and the unstated ε→0 commutation assumption.

axioms (7)
  • standard math All-Minors Matrix-Tree Theorem (Chaiken) gives graph-theoretic expressions for FPT moments and Laplace transforms (Eq. 10, Eq. 13).
    Used as the foundation for the two-tree forest expansions; cited to [84] and adopted without proof.
  • standard math Perron-Frobenius theorem guarantees a simple dominant real eigenvalue for the positive matrix M (Sec. III A).
    Invoked to justify the intuition that λ_1^{-1} is the Perron-Frobenius eigenvalue and that the spectrum is real in the reversible case.
  • standard math Lawler-Sokal Cheeger inequality bounds the spectral gap of a strongly connected Markov chain in terms of conductance (Eq. 33).
    Used in the deterministic-limit condition; cited to [89].
  • standard math Cauchy interlacing theorem for eigenvalues of principal minors of Hermitian matrices (Sec. III D, Supp. IV).
    Used to relate eigenvalues of different principal minors in the reversible exponential-limit proof.
  • domain assumption Detailed balance / reversibility of the network for the exponential-limit theorem (Sec. II A and Sec. III D).
    The interlacing argument and the relation ⟨τ⟩_{N→m}/⟨τ⟩_{m→N} → 0 require the generator to be similar to a symmetric matrix; the paper states this as an explicit condition.
  • domain assumption The macroscopic forest condition r < ∞ is assumed to hold for the limit theorems (Sec. III B).
    The paper argues this is natural for starts 'far' from the target, but it is an assumption about the network family, not derived from the transition rates.
  • ad hoc to paper In the conductance criterion, the ε→0 back-rate limit commutes with the N→∞ limit (Sec. III C).
    The paper introduces a small back-rate from N to make the graph strongly connected, applies Cheeger, and then lets ε→0. The uniformity of the conductance bound in ε is not established.

pith-pipeline@v1.3.0-alltime-deepseek · 25029 in / 25313 out tokens · 215415 ms · 2026-08-02T21:58:28.648858+00:00 · methodology

0 comments
read the original abstract

First-passage times are often the most relevant aspect of a complex Markovian network because they signify when information processing has resulted in a definite decision. Previous studies have shown that for kinetic proofreading networks in the limit of large network size the first-passage time distribution converges either to a delta or to an exponential distribution. Remarkably, these two forms correspond to the two extreme distributions of minimal and maximal entropy for a fixed mean, respectively. Here we build on the connection between first-passage times and graph theory to show that these two limits are not model-specific, but arise generically in Markovian networks from the distribution of the eigenvalues of the generator matrix. A deterministic peak emerges when infinitely many eigenvalues contribute, while the exponential limit arises from a single dominant eigenvalue. We also show that the exponential limit emerges robustly for reversible networks when the mean first-passage time from the initial state to the target state becomes much larger than the mean first-passage time in the reverse direction. In contrast, the deterministic limit is not obtained from a simple reversal of this condition, but follows from a non-vanishing conductance or a mean-residual lifetime of the process which becomes small compared to the mean first-passage time in the long-time limit. This reveals a fundamental asymmetry between the two regimes. Our theoretical analysis is illustrated and validated by computer simulations of one-step master equations and random networks.

Figures

Figures reproduced from arXiv: 2602.18265 by Julian B. Voits, Ulrich S. Schwarz (Heidelberg University).

Figure 1
Figure 1. Figure 1: FIG. 1: Generic first-passage time (FPT) distributions for large Markovian networks. (a) FPT in a large network: a [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: FIG. 2: The first-passage time (FPT) of a one-step master equation compared to its mean as system size [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: FIG. 3: Illustration of graph theoretical concepts. (a) [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: FIG. 4: A minimal example to illustrate how [PITH_FULL_IMAGE:figures/full_fig_p008_4.png] view at source ↗
Figure 6
Figure 6. Figure 6: FIG. 6: Example of a randomly generated graph with [PITH_FULL_IMAGE:figures/full_fig_p009_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: FIG. 7: First-passage times and eigenvalue ratios for random networks of increasing size. (a) For reversible networks [PITH_FULL_IMAGE:figures/full_fig_p011_7.png] view at source ↗

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Spectral Purification in Reversible Markov Chains: Hidden Parameters, Observable Equivalence, and Finite-Time Rigidity

    math.PR 2026-05 unverdicted novelty 7.0

    Reversible Markov chains possess finite-time spectral rigidity controlled by eigenvalue separation, with two-sided bounds on rigidity time and a covariance-based spectral entropy theory.

  2. Spectral Purification in Reversible Markov Chains: Hidden Parameters, Observable Equivalence, and Finite-Time Rigidity

    math.PR 2026-05 unverdicted novelty 7.0

    Spectral purification in reversible Markov chains is controlled by a hidden parameter x_k driven by the eigenvalue ratio λ3/λ2, making six diagnostics equivalent and yielding non-asymptotic bounds on rigidity time plu...

  3. Graph theoretic derivation of mutual linearity for transient probabilities and hitting time distributions in Markov networks

    cond-mat.stat-mech 2026-04 unverdicted novelty 7.0

    Graph theory yields explicit combinatorial formulas showing mutual linearity for transient occupation probabilities and hitting time distributions in Markov networks.

Reference graph

Works this paper leans on

113 extracted references · 2 linked inside Pith · cited by 2 Pith papers

  1. [1]

    Boccaletti, V

    S. Boccaletti, V. Latora, Y. Moreno, M. Chavez, and D.- U. Hwang, Complex networks: Structure and dynamics, Physics reports424, 175 (2006)

    2006

  2. [2]

    Newman, A.-L

    M. Newman, A.-L. Barab´ asi, and D. J. Watts,The structure and dynamics of networks(Princeton univer- sity press, 2011)

    2011

  3. [3]

    Newman,Networks(Oxford university press, 2018)

    M. Newman,Networks(Oxford university press, 2018)

    2018

  4. [4]

    Hinrichsen, Non-equilibrium critical phenomena and phase transitions into absorbing states, Advances in physics49, 815 (2000)

    H. Hinrichsen, Non-equilibrium critical phenomena and phase transitions into absorbing states, Advances in physics49, 815 (2000)

    2000

  5. [5]

    Baronchelli, M

    A. Baronchelli, M. Felici, V. Loreto, E. Caglioti, and L. Steels, Sharp transition towards shared vocabularies in multi-agent systems, Journal of Statistical Mechanics: Theory and Experiment2006, P06014 (2006)

    2006

  6. [7]

    Condamin, O

    S. Condamin, O. B´ enichou, V. Tejedor, R. Voituriez, and J. Klafter, First-passage times in complex scale- invariant media, Nature450, 77 (2007)

    2007

  7. [8]

    Metzler, S

    R. Metzler, S. Redner, and G. Oshanin,First-passage phenomena and their applications, Vol. 35 (World Sci- entific, 2014)

    2014

  8. [9]

    Tkaˇ cik and P

    G. Tkaˇ cik and P. R. t. Wolde, Information processing in biochemical networks, Annual review of biophysics54 (2025)

    2025

  9. [10]

    J. J. Hopfield, Kinetic proofreading: a new mechanism for reducing errors in biosynthetic processes requiring high specificity, Proceedings of the National Academy of Sciences71, 4135 (1974)

    1974

  10. [11]

    Ninio, Kinetic amplification of enzyme discrimina- tion, Biochimie57, 587 (1975)

    J. Ninio, Kinetic amplification of enzyme discrimina- tion, Biochimie57, 587 (1975)

    1975

  11. [12]

    T. W. McKeithan, Kinetic proofreading in T-cell re- ceptor signal transduction., Proceedings of the national academy of sciences92, 5042 (1995)

    1995

  12. [13]

    H¨ anggi, P

    P. H¨ anggi, P. Talkner, and M. Borkovec, Reaction-rate theory: fifty years after Kramers, Reviews of Modern Physics62, 251 (1990)

    1990

  13. [14]

    Hofmann and F

    H. Hofmann and F. A. Ivanyuk, Mean first passage time for nuclear fission and the emission of light particles, Physical review letters90, 132701 (2003)

    2003

  14. [15]

    B´ enichou and R

    O. B´ enichou and R. Voituriez, From first-passage times of random walks in confinement to geometry-controlled kinetics, Physics Reports539, 225 (2014)

    2014

  15. [16]

    Friedman, D

    H. Friedman, D. A. Kessler, and E. Barkai, Quantum walks: The first detected passage time problem, Physi- cal Review E95, 032141 (2017)

    2017

  16. [17]

    Hasegawa, Thermodynamic uncertainty relation for quantum first-passage processes, Physical Review E 105, 044127 (2022)

    Y. Hasegawa, Thermodynamic uncertainty relation for quantum first-passage processes, Physical Review E 105, 044127 (2022)

    2022

  17. [18]

    Q. Wang, S. Ren, R. Yin, K. Ziegler, E. Barkai, and S. Tornow, First hitting times on a quantum computer: Tracking vs. local monitoring, topological effects, and dark states, Entropy26, 869 (2024)

    2024

  18. [19]

    M. J. Kewming, A. Kiely, S. Campbell, and G. T. Landi, First passage times for continuous quantum measure- ment currents, Physical Review A109, L050202 (2024)

    2024

  19. [20]

    Prech, G

    K. Prech, G. T. Landi, F. Meier, N. Nurgalieva, P. P. Potts, R. Silva, and M. T. Mitchison, Optimal time esti- mation and the clock uncertainty relation for stochastic processes, Physical Review X15, 031068 (2025)

    2025

  20. [21]

    Szabo, K

    A. Szabo, K. Schulten, and Z. Schulten, First passage time approach to diffusion controlled reactions, The Journal of chemical physics72, 4350 (1980)

    1980

  21. [22]

    E. J. Woods and D. J. Wales, Analysis and interpre- tation of first passage time distributions featuring rare events, Physical Chemistry Chemical Physics26, 1640 (2024)

    2024

  22. [23]

    C. Rao, D. Waxman, W. Lin, and Z. Song, Exact first- passage time distributions from time-dependent solu- tions of the chemical master equation. I. Nonlinear net- works with bimolecular reactions and poisson-product initial conditions, The Journal of Chemical Physics162 (2025)

    2025

  23. [24]

    C. Rao, D. Waxman, W. Lin, and Z. Song, Exact first- passage time distributions from time-dependent solu- tions of the chemical master equation. II. Nonlinear networks with bimolecular reactions and arbitrary ini- tial conditions, The Journal of Chemical Physics162 (2025)

    2025

  24. [25]

    P. C. Bressloff,Stochastic processes in cell biology, Vol. 41 (Springer, 2014)

    2014

  25. [26]

    Chou and M

    T. Chou and M. R. D’Orsogna, First passage problems in biology, inFirst-passage phenomena and their appli- cations(World Scientific, 2014) pp. 306–345. 14

    2014

  26. [27]

    Iyer-Biswas and A

    S. Iyer-Biswas and A. Zilman, First-passage processes in cellular biology, Advances in chemical physics160, 261 (2016)

    2016

  27. [28]

    Polizzi, M.J.Therien, and D

    N. Polizzi, M.J.Therien, and D. Beratan, Mean first- passage times in biology, inIsr J Chem. 56 (9-10):816- 824(2017)

    2017

  28. [29]

    F. Frey, F. Ziebert, and U. S. Schwarz, Stochastic dy- namics of nanoparticle and virus uptake, Physical Re- view Letters122, 088102 (2019)

    2019

  29. [30]

    T. L. Kaufmann and U. S. Schwarz, Electrostatic and bending energies predict staggering and splaying in non- muscle myosin II minifilaments, PLOS Computational Biology16, e1007801 (2020)

    2020

  30. [31]

    Bebon and U

    R. Bebon and U. S. Schwarz, First-passage times in com- plex energy landscapes: a case study with nonmuscle myosin II assembly, New Journal of Physics24, 063034 (2022)

    2022

  31. [32]

    Black and J

    F. Black and J. C. Cox, Valuing corporate securities: Some effects of bond indenture provisions, The Journal of Finance31, 351 (1976)

    1976

  32. [33]

    H. E. Leland and K. B. Toft, Optimal capital structure, endogenous bankruptcy, and the term structure of credit spreads, The journal of finance51, 987 (1996)

    1996

  33. [34]

    Perell´ o, M

    J. Perell´ o, M. Guti´ errez-Roig, and J. Masoliver, Scal- ing properties and universality of first-passage-time probabilities in financial markets, Physical Review E—Statistical, Nonlinear, and Soft Matter Physics84, 066110 (2011)

    2011

  34. [35]

    Honerkamp,Stochastic dynamical systems: concepts, numerical methods, data analysis(John Wiley & Sons, 1996)

    J. Honerkamp,Stochastic dynamical systems: concepts, numerical methods, data analysis(John Wiley & Sons, 1996)

    1996

  35. [36]

    Redner,A guide to first-passage processes(Cam- bridge university press, 2001)

    S. Redner,A guide to first-passage processes(Cam- bridge university press, 2001)

    2001

  36. [37]

    van Kampen,Stochastic processes in physics and chemistry(North-Holland, 2004)

    N. van Kampen,Stochastic processes in physics and chemistry(North-Holland, 2004)

    2004

  37. [38]

    B´ enichou, C

    O. B´ enichou, C. Chevalier, J. Klafter, B. Meyer, and R. Voituriez, Geometry-controlled kinetics, Nature chemistry2, 472 (2010)

    2010

  38. [39]

    Baravi, D

    T. Baravi, D. A. Kessler, and E. Barkai, Solutions of first-passage time problems: A biscaling approach, Physical Review E111, 044103 (2025)

    2025

  39. [40]

    Baravi, D

    T. Baravi, D. A. Kessler, and E. Barkai, First passage times in compact domains exhibit biscaling, Physical Review Letters134, 127101 (2025)

    2025

  40. [41]

    Godec and R

    A. Godec and R. Metzler, First passage time distribu- tion in heterogeneity controlled kinetics: going beyond the mean first passage time, Scientific reports6, 20349 (2016)

    2016

  41. [42]

    Godec and R

    A. Godec and R. Metzler, Universal proximity effect in target search kinetics in the few-encounter limit, Phys- ical Review X6, 041037 (2016)

    2016

  42. [43]

    D. T. Gillespie, A rigorous derivation of the chemical master equation, Physica A: Statistical Mechanics and its Applications188, 404 (1992)

    1992

  43. [44]

    Murugan, D

    A. Murugan, D. A. Huse, and S. Leibler, Speed, dissipa- tion, and error in kinetic proofreading, Proceedings of the National Academy of Sciences109, 12034 (2012)

    2012

  44. [45]

    G. Bel, B. Munsky, and I. Nemenman, The simplicity of completion time distributions for common complex biochemical processes, inPhysical biology 7.1: 016003 (2009)

    2009

  45. [46]

    Munsky, I

    B. Munsky, I. Nemenman, and G. Bel, Specificity and completion time distributions of biochemical processes, The Journal of Chemical Physics131(2009)

    2009

  46. [47]

    Bomze, R

    Y. Bomze, R. Hey, H. Grahn, and S. Teitsworth, Noise- induced current switching in semiconductor superlat- tices: observation of nonexponential kinetics in a high- dimensional system, Physical review letters109, 026801 (2012)

    2012

  47. [48]

    H. S. Chung, Transition path times measured by single- molecule spectroscopy, Journal of molecular biology 430, 409 (2018)

    2018

  48. [49]

    A. L. Thorneywork, J. Gladrow, Y. Qing, M. Rico- Pasto, F. Ritort, H. Bayley, A. B. Kolomeisky, and U. F. Keyser, Direct detection of molecular interme- diates from first-passage times, Science advances6, eaaz4642 (2020)

    2020

  49. [50]

    D. B. Broadwater, A. W. Cook, and H. D. Kim, First passage time study of DNA strand displacement, Bio- physical Journal120, 2400 (2021)

    2021

  50. [51]

    Zunke, J

    C. Zunke, J. Bewerunge, F. Platten, S. U. Egelhaaf, and A. Godec, First-passage statistics of colloids on fractals: Theory and experimental realization, Science advances 8, eabk0627 (2022)

    2022

  51. [52]

    Singh, M

    D. Singh, M. Urbakh, and S. Reuveni, Inferring binding rates from enzymatic turnover time statistics, bioRxiv , 2025 (2025)

    2025

  52. [53]

    J. C. Bayer, F. Brange, A. Schmidt, T. Wagner, E. P. Rugeramigabo, C. Flindt, and R. J. Haug, Real-time detection and control of correlated charge tunneling in a quantum dot, Physical Review Letters134, 046303 (2025)

    2025

  53. [54]

    Van der Meer, B

    J. Van der Meer, B. Ertel, and U. Seifert, Thermo- dynamic inference in partially accessible Markov net- works: A unifying perspective from transition-based waiting time distributions, Physical Review X12, 031025 (2022)

    2022

  54. [55]

    J. H. Fritz, B. Ertel, and U. Seifert, Entropy estimation for partially accessible Markov networks based on im- perfect observations: Role of finite resolution and finite statistics, Physical Review E111, 044106 (2025)

    2025

  55. [56]

    A. M. Maier, U. Seifert, and J. van der Meer, From ob- served transitions to hidden paths in Markov networks, Physical Review Research7, 033067 (2025)

    2025

  56. [57]

    Bebon and A

    R. Bebon and A. Godec, Controlling uncertainty of em- pirical first-passage times in the small-sample regime, Physical Review Letters131, 237101 (2023)

    2023

  57. [58]

    Jarzynski, Equilibrium free-energy differences from nonequilibrium measurements: A master-equation ap- proach, Physical Review E56, 5018 (1997)

    C. Jarzynski, Equilibrium free-energy differences from nonequilibrium measurements: A master-equation ap- proach, Physical Review E56, 5018 (1997)

    1997

  58. [59]

    Jarzynski, Equalities and inequalities: Irreversibility and the second law of thermodynamics at the nanoscale, inTime: Poincar´ e Seminar 2010(Springer, 2012) pp

    C. Jarzynski, Equalities and inequalities: Irreversibility and the second law of thermodynamics at the nanoscale, inTime: Poincar´ e Seminar 2010(Springer, 2012) pp. 145–172

    2010

  59. [60]

    Seifert, Stochastic thermodynamics, fluctuation the- orems and molecular machines, Reports on progress in physics75, 126001 (2012)

    U. Seifert, Stochastic thermodynamics, fluctuation the- orems and molecular machines, Reports on progress in physics75, 126001 (2012)

    2012

  60. [61]

    Seifert,Stochastic thermodynamics(Cambridge Uni- versity Press, 2025)

    U. Seifert,Stochastic thermodynamics(Cambridge Uni- versity Press, 2025)

    2025

  61. [62]

    Hartich and A

    D. Hartich and A. Godec, Extreme value statistics of er- godic Markov processes from first passage times in the large deviation limit, Journal of Physics A: Mathemat- ical and Theoretical52, 244001 (2019)

    2019

  62. [63]

    Lapolla, D

    A. Lapolla, D. Hartich, and A. Godec, Spectral theory of fluctuations in time-average statistical mechanics of re- versible and driven systems, Physical Review Research 2, 043084 (2020)

    2020

  63. [64]

    Nam,Algebraic approaches to molecular information 15 processing, Ph.D

    K. Nam,Algebraic approaches to molecular information 15 processing, Ph.D. thesis, Harvard University (2021)

    2021

  64. [65]

    K. Nam, R. Martinez-Corral, and J. Gunawardena, The linear framework: using graph theory to reveal the al- gebra and thermodynamics of biomolecular systems, In- terface Focus12, 20220013 (2022)

    2022

  65. [66]

    Nam and J

    K. Nam and J. Gunawardena, The linear framework II: using graph theory to analyse the transient regime of Markov processes, inFrontiers in Cell and Developmen- tal Biology, 11, 1233808(2023)

    2023

  66. [67]

    Khodabandehlou, C

    F. Khodabandehlou, C. Maes, and K. Netoˇ cn` y, Trees and forests for nonequilibrium purposes: an introduc- tion to graphical representations, Journal of Statistical Physics189, 41 (2022)

    2022

  67. [68]

    Khodabandehlou, C

    F. Khodabandehlou, C. Maes, and K. Netoˇ cn` y, A nernst heat theorem for nonequilibrium jump processes, The Journal of Chemical Physics158(2023)

    2023

  68. [69]

    Khodabandehlou, C

    F. Khodabandehlou, C. Maes, I. Maes, and K. Netoˇ cn` y, The vanishing of excess heat for nonequilibrium pro- cesses reaching zero ambient temperature, inAnnales Henri Poincar´ e, Vol. 25 (Springer, 2024) pp. 3371–3403

    2024

  69. [70]

    Both the network topology and the rates are obtained by random processes

    to obtain networks with clear starting and end points. Both the network topology and the rates are obtained by random processes. Inserting these into Eq. (5), one has: ⟨τ⟩ 1→N = 3 2 N 2 +1 +O(N) (50) ⟨τ⟩ N→1 = 3 N 2 +1 +O(N).(51) Therefore, lim N→∞ ⟨τ⟩ 1→N ⟨τ⟩ N→1 = 0. Despite this apparent forward bias, the FPT from state 1 to stateNis domi- nated by the...

  70. [72]

    S. J. Haque,Graph-theoretic approaches to biochemical reaction networks(Harvard University, 2024)

    2024

  71. [73]

    Nam and J

    K.-M. Nam and J. Gunawardena, Algebraic formulas for first-passage times of Markov processes in the lin- ear framework, Bulletin of Mathematical Biology87, 1 (2025)

    2025

  72. [74]

    C. W. Gardineret al.,Handbook of stochastic methods, Vol. 3 (springer Berlin, 2004)

    2004

  73. [75]

    G. G. Yin and Q. Zhang,Continuous-time Markov chains and applications: a singular perturbation ap- proach, Vol. 37 (Springer, 2012)

    2012

  74. [76]

    Li and A

    X. Li and A. B. Kolomeisky, Mechanisms and topology determination of complex chemical and biological net- work systems from first-passage theoretical approach, The Journal of chemical physics139(2013)

    2013

  75. [77]

    X. Li, A. B. Kolomeisky, and A. Valleriani, Pathway structure determination in complex stochastic networks with non-exponential dwell times, The Journal of Chem- ical Physics140(2014)

    2014

  76. [78]

    Smith and V

    S. Smith and V. Shahrezaei, General transient solution of the one-step master equation in one dimension, Phys- ical Review E91, 062119 (2015)

    2015

  77. [79]

    Assaf and B

    M. Assaf and B. Meerson, WKB theory of large devi- ations in stochastic populations, Journal of Physics A: Mathematical and Theoretical50, 263001 (2017)

    2017

  78. [80]

    E. A. van Doorn, An orthogonal-polynomial approach to first-hitting times of birth–death processes, Journal of Theoretical Probability30, 594 (2017)

    2017

  79. [81]

    Kononovicius and V

    A. Kononovicius and V. Gontis, Approximation of the first passage time distribution for the birth–death pro- cesses, Journal of Statistical Mechanics: Theory and Ex- periment2019, 073402 (2019)

    2019

  80. [82]

    D. T. Gillespie, Exact stochastic simulation of coupled chemical reactions, The journal of physical chemistry 81, 2340 (1977)

    1977

Showing first 80 references.