Pith. sign in

REVIEW 2 major objections 4 minor 55 references

Predicting First-Passage Dynamics in Disordered Systems Exactly: Application to Sparse Networks

T0 review · 2 major / 4 minor · reviewed 2026-08-05 · deepseek-v4-flash

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

Pith's one-line read Random walks on sparse small-world networks can be solved exactly by treating each rewired link as a probability-preserving defect, and the solution exposes a bimodal first-absorption regime in which the mean first-passage time loses its us

desk verdict Serious mechanics paper with genuinely new ring-lattice results; the SWN exactness claim needs a sharper accounting of defects before I'd fully trust it. read the letter →

arxiv 2508.10140 v1 pith:NAPPZEYW submitted 2025-08-13 cond-mat.stat-mech

Daniel Marris , Chittaranjan Hens , Subrata Ghosh , Luca Giuggioli This is my paper · ORCID
classification cond-mat.stat-mech
keywords first-passageprobabilitymeantimesmall-worldnetworksrandomwalksinertdefectsdisorderedsystemsbimodalfirst-absorptionWatts-Strogatznetwork
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

This paper claims that the search dynamics of a random walker on a sparse Watts-Strogatz small-world network can be computed exactly, without stochastic simulation. The central move is to view the network as a homogeneous $K$-neighbour ring lattice plus a small number of 'inert' defects: each rewired edge is encoded as a four-tuple of transition-probability changes, and the exact occupation and first-passage probabilities follow from determinants of $M\times M$ matrices built from ring-lattice propagators. Applied to small-world networks, the method uncovers a bimodal first-absorption distribution in symmetric diffusive systems. In that regime the mean first-passage time is not controlled by the direct trajectories and does not represent the typical time of the indirect ones. If correct, this closes a gap in target-search theory and changes how mean first-passage-time values on disordered networks should be read.

What carries the argument

The inert-defect machinery: any rewiring that preserves total probability is encoded as deviations from the ring-lattice transition matrix, each stored as a four-tuple $(u, v, \eta_{v,u}, \eta_{u,v})$, and the exact propagator on the disordered network is the ring-lattice propagator plus the ratio of two $M\times M$ determinants, Eqs. (S58)--(S60). The companion object is the closed-form $K$-neighbour ring-lattice propagator (Eq. 2) and its mean first-passage time (Eq. 4); every network-level expression is built from these ring quantities and the $\eta$ parameters. The determinants carry all disorder information, which is why the cost scales with the number of defects $M = (K+1)pN$ rather th

What would settle it

Take one fixed Watts-Strogatz realization (for example the $N=100$, $K=6$, $p=0.15$ case of Fig. 2), compute the occupation probability from Eq. (S58) at several times, and compare it with the average of a large number of simulated walks on that same graph; any node-time pair where the difference exceeds Monte Carlo sampling error would show the four-tuple or determinant representation is incomplete. The bi-modality claim can be tested directly by measuring the first-absorption distribution in the predicted $N/K$ window and looking for two resolved peaks.

Watch

Extended reading notes

Core claim

The central claim is that a random walk on a Watts-Strogatz network is exactly solvable through the inert-defect representation. The difference $X = B - A$ between the ring-lattice transition matrix and the rewired network transition matrix is a sparse correction captured by $M$ four-tuples $(u, v, \eta_{v,u}, \eta_{u,v})$; substituting these into the determinant formulas (S58)--(S61) gives the occupation probability, the first-passage probability, and the mean first-passage time for any realization of the disorder. On the defect-free ring the paper derives a new $K$-neighbour propagator generating function (Eq. 2) and mean first-passage time (Eq. 4), recovering known nearest-neighbour and f

Load-bearing premise

Everything rests on the claim that the rewired network's transition matrix differs from the ring lattice's only through the listed four-tuples, and that the determinant formula of Eq. (S58) inherited from the defect formalism remains exact for that rewired graph; if a rewiring introduces a transition change the four-tuple list misses, the exact small-world results fail.

Editorial extensions

If this is right

  • For a single fixed realization of a small-world network, the full time-dependent occupation probability and first-passage probability are available from closed-form expressions, so Monte Carlo averages are no longer required in the sparse regime.
  • The exact $K$-neighbour ring-lattice results fill the gap between the known nearest-neighbour chains and the fully connected graph; both limits drop out of the same formulas.
  • Bi-modality of the first-absorption distribution is a genuine feature of symmetric diffusive systems, and its onset is set by $N/K$ and $\rho$, so a single mean first-passage time cannot summarize the search process in that regime.
  • In the bi-modal regime the mean first-passage time is decoupled from direct-trajectory statistics; the early mode reflects local structure around start and target, the late mode reflects global structure.
  • The method transfers to any graph that is a solvable base structure plus a set of defects; the cost is set by the number of defects, not the network size.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The same four-tuple determinant construction should carry over to base graphs other than ring lattices, such as regular trees, tori, or Cartesian-product lattices, by replacing Eq. (2) in Eqs. (S58)--(S60); the hard part is only knowing the defect-free propagator.
  • The bi-modality boundaries in the $(N/K, \rho)$ plane invite a scaling-collapse test: plotting the two-mode separation against $N/K$ for fixed $\rho$ should make the coloured regions in Fig. 3(a)--(b) line up onto a single curve.
  • The paper's own stated boundary is computational rather than conceptual: the determinants are $M\times M$ with $M = (K+1)pN$, so the method is exact but heavy when rewiring is dense; the practical gain over simulation is in the sparse, high-clustering regime.
  • The observed decoupling of the mean first-passage time from direct trajectories implies that MFPT-based centrality or target-search rankings on networks with long-range links can be systematically misleading; mode times or the full distribution are safer summary statistics.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

2 major / 4 minor

Summary. The paper develops an analytical framework for computing first-passage statistics of a random walk on sparse networks, specifically Watts-Strogatz small-world networks built from a K-neighbor ring lattice. The defect-free ring propagator is derived in closed form (Eq. 2), the ring MFPT is given in Eq. (4), and the inert-defect formalism of Ref. [10] is used to represent the rewired network as a ring plus a set of localized transition-probability modifications. The resulting occupation-probability generating function (Eq. S58) and MFPT formula (Eq. S61) are then used to obtain first-absorption distributions and mean times. The paper reports a bimodal regime in the first-absorption distribution, argues that the MFPT can decouple from the statistics of direct trajectories, and claims that these are the first such results for symmetric diffusive systems. The central exactness claim rests on the completeness of the four-tuple defect set used in Eqs. (S58)-(S61).

Significance. If the defect representation is exact and complete, this is a valuable contribution: it provides parameter-free analytical expressions for occupation and first-passage statistics on sparse networks, recovering the k=1 and fully connected limits of the ring, and it makes the bimodality phenomenon accessible without stochastic simulation. The paper explicitly checks several analytic curves against independent stochastic simulations (Figs. 1-2, S1), and the determinant formulas are quoted from a published framework. However, the significance is conditional on the defect-count issue raised below: the stated number of four-tuples in Eq. (5) appears inconsistent with the number of nonzero entries of X=B-A, and because the actual construction is not provided, the reader cannot verify that the figures used the full defect set.

major comments (2)
  1. [Dynamics on the network, Eq. (5)] The stated defect count is not consistent with the Watts-Strogatz rewiring described in the Letter. Under the standard prescription, the expected number of rewired edges is pNK/2, not pN. More importantly, a single rewiring (a,b)->(a,c) changes the degree of b from K to K-1 and the degree of c from K to K+1. The nonzero entries of X=B-A are then: two in row a (to b and to c), K in row b (the removed edge plus the K-1 remaining neighbors), and K+1 in row c (the new edge plus the K existing neighbors). Thus X has 2K+3 nonzero directed entries, or 2K+1 pairs (i,j) usable as four-tuples, not K+1. If the actual calculations used the full X, then Eq. (5) is wrong and the sparsity condition K+1<1/p is misleading. If they used M=(K+1)pN, the defect set is incomplete and the 'exact' network results in Figs. 1-3 and S1 are not exact. The manuscript must provide the explicit four-tuple construction
  2. [SM Sec. VI / Fig. 3] The engineered one-shortcut network is stated to require M=K+1 defects. Adding one shortcut between two vertices raises the degree of both endpoints from K to K+1, so every outgoing probability from each endpoint changes: the K existing edges and the new edge. This requires 2K+1 four-tuples, or 2(K+1) directed entries, not K+1. Unless a special normalization is being used that is not explained, the phase diagrams in Figs. 3(a,b), the distributions in Fig. 3(c), and the mode/MFPT comparison in Fig. 3(d) are computed with an incomplete defect matrix. The bimodality boundaries and the decoupling claim must be re-established with the full defect set.
minor comments (4)
  1. [Dynamics on the network, Eq. (5)] Even if the per-rewiring count were correct, 'each SWN has, on average, pN re-wirings [28]' misrepresents Ref. [28]; the standard Watts-Strogatz construction rewires each edge with probability p, giving pNK/2 expected rewired edges. Clarify which construction is used.
  2. [Defect extraction paragraph after Eq. (6)] The sentence 'we find the modifications ... as the non-zero elements of X' is ambiguous: a four-tuple (i,j,Xj,i,Xi,j) stores two directed entries, so it should be specified whether M counts nonzero directed entries or nonzero pairs. This ambiguity directly affects the size of the determinant matrices in Eqs. (S58)-(S61).
  3. [General discussion / Abstract] The parametric characterization of the bimodal regime (N/K and rho dependence) is established only for the engineered one-shortcut network; the random-SWN evidence is a single realization (Fig. 2, Graph 4). The abstract and Discussion phrase the result as a property of small-world networks generally. Either provide ensemble-level statistics for random SWNs or explicitly restrict the claim to the engineered defect network.
  4. [Fig. 3 and time-domain inversion] The Letter says predictions are 'exact,' but the time-domain curves in Fig. 3 are obtained by numerical inversion of the generating function. This is a standard and acceptable procedure, but the wording should distinguish exact generating functions from the numerical inversion used for display.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the derivation is parameter-free, the defect set is extracted from the graph transition matrix, and central results are checked against independent stochastic simulations.

full rationale

The paper's derivation chain is self-contained and does not reduce its predictions to its inputs. The ring-lattice propagator Eq. (2) and MFPT Eq. (4) are derived from the Master equation Eq. (1) by standard Fourier/z-transform and renewal arguments, with no fitted parameters. For the small-world network, the defect set is obtained by computing X = B - A and taking 'the non-zero elements of X' as four-tuples, so the exactness of the inert-defect representation depends on the full matrix difference, not on the heuristic count M = (K+1)pN, which is only an average complexity estimate. The subsequent determinant formulas (S58)-(S64) are quoted from the authors' prior work [10], but this is an externally published, parameter-free formalism with stated assumptions (inert, probability-preserving defects) that does not itself include the target SWN result; it is therefore independent support rather than circular self-citation. The central bimodality claim is verified against independent stochastic simulations in Fig. 2 and Fig. S1. No fitted parameter is renamed as a prediction, no result is defined in terms of another result, and no uniqueness theorem is imported. The Discussion's limitation—that the method requires a defect-free topology whose dynamics are known—is an acknowledged scope condition, not a circular step. Overall, no circularity is present.

Assumptions & free parameters 2 free parameters · 6 assumptions · 0 invented entities

The central claim rests on the ring-lattice propagator, the defect representation of rewired links, and the determinant formalism quoted from the authors' earlier work. No new entities are introduced. The only hand-chosen inputs are the shortcut placement in the engineered network and the numerical thresholds used to define a mode; both affect the reported bimodality boundaries but not the exact ring results.

free parameters (2)
  • Shortcut endpoint offsets in engineered network = n0+5 and n+1
    Hand-chosen spacing in the Fig. 3 engineered network; it sets the direct-trajectory timescale and is not derived from data. The bimodal regime boundaries are conditional on this choice.
  • Mode detection thresholds = peak height > 10^-7; second mode at least 1% of tallest peak
    These thresholds define what counts as a mode in Fig. 3 and the supplementary figures. They are chosen by hand and could shift the phase boundaries.
assumptions (6)
  • domain assumption Walkers perform discrete-time jumps with uniform probability 1/K to the K nearest neighbors on the ring (Eq. 1).
    Defines the base dynamics; all later expressions depend on this transition rule.
  • domain assumption Watts-Strogatz rewiring can be represented as M=(K+1)pN inert defects that preserve transition probabilities at each node (Eq. 5).
    This defect count and representation underpin Eq. (6) and the determinant formulas; if a rewiring changes coordination in a way not captured by four-tuples, the exactness fails.
  • domain assumption Inert defect formalism of ref [10]: the propagator on a graph with defects is the ratio of determinants in Eq. (S58).
    Central to all network results; quoted from prior work by the same group and not re-derived here.
  • standard math Method of images and Fourier/z-transform identities for the finite ring (SM Sec. I).
    Used to derive Eq. (2) and the k=1,2,3 closed forms.
  • standard math Renewal relation A = rho*Q/(1-rho+rho*Q) links occupation to first-absorption (Eq. 3).
    Standard renewal/generating-function identity used to extract FP statistics.
  • domain assumption Numerical trapezoidal inversion of generating functions (ref [54]) reproduces the true time-domain probabilities.
    All time-domain FP curves in Figs 2, 3, and S2 are obtained by numerical inversion, so exactness applies to the generating function, not directly to the plotted time series.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Predicting First-Passage Dynamics in Disordered Systems Exactly: Application to Sparse Networks." pith.science (2026). https://pith.science/paper/NAPPZEYW

@misc{pith2026250810140,
  author       = {Pith},
  title        = {Pith review of: Predicting First-Passage Dynamics in Disordered Systems Exactly: Application to Sparse Networks},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/NAPPZEYW}},
  note         = {Machine review of arXiv:2508.10140}
}
read the original abstract

Quantifying how spatial disorder affects the movement of a diffusing particle or agent is fundamental to target search studies. When diffusion occurs on a network, that is on a highly disordered environment, we lack the mathematical tools to calculate exactly the temporal characteristics of search processes, instead relying on estimates provided by stochastic simulations. To close this knowledge gap we devise a general methodology to represent analytically the movement and search dynamics of a diffusing random walk on sparse graphs. We show its utility by uncovering the existence of a bi-modality regime in the time-dependence of the first-passage probability to hit a target node in a small-world network. By identifying the network features that give rise to the bi-modal regime, we challenge long-held beliefs on how the statistics of the so-called direct, intermediate, and indirect trajectories influence the shape of the resulting first-passage and first-absorption probabilities and the interpretation of their mean values. Overall these findings show that temporal features in first-passage studies can be utilised to unearth novel transport paradigms in spatially heterogeneous environments.

Figures

Figures reproduced from arXiv: 2508.10140 by the authors.

Figure 1
Figure 1. FIG. 1. A comparison between the MFPT (red axis on the left) and the graph properties of the characteristic path length, [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. FIG. 2. A comparison of the FP distributions for four independent realisations of the SWN constructed from [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 3
Figure 3. FIG. 3. Bi-modality in the first-absorption distribution from [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

55 extracted references · 54 canonical work pages

  1. [10]

    Sarvaharman and L

    S. Sarvaharman and L. Giuggioli. Particle-environment interactions in arbitrary dimensions: a unifying analytic framework to model diffusion with inert spatial hetero- geneities. Phys. Rev. Res. , 5(4):043281, 2023

    work page 2023

  2. [1]

    Khafagy, W

    M. Khafagy, W. El-Dakhakhni, and S. Dickson- Anderson. Analytical model for solute transport in dis- crete fracture networks: 2d spatiotemporal solution with matrix diffusion. Comput. Geosci., 159:104983, 2022

    work page 2022

  3. [2]

    Ketter, N

    L. Ketter, N. Greb, T. Bernges, and W. G. Zeier. Using resistor network models to predict the transport prop- erties of solid-state battery composites. Nat. Commun. , 16(1):1–9, 2025

    work page 2025

  4. [3]

    Berthier and G

    L. Berthier and G. Biroli. Theoretical perspective on the glass transition and amorphous materials. Rev. Mod. Phys., 83(2):587–645, 2011

    work page 2011

  5. [4]

    Tsingos, B

    E. Tsingos, B. H. Bakker, K. A. E. Keijzer, H. J. Hupkes, and R. M. H. Merks. Hybrid cellular potts and bead- spring modeling of cells in fibrous extracellular matrix. Biophys. J. , 122(13):2609–2622, 2023

    work page 2023

  6. [5]

    Kenkre and L

    V.M. Kenkre and L. Giuggioli. Theory of the spread of epidemics and movement ecology of animals: an inter- disciplinary approach using methodologies of physics and mathematics. Cambridge University Press, 2021

    work page 2021

  7. [6]

    Scher and M

    H. Scher and M. Lax. Stochastic transport in a disor- dered solid. i. theory. Phys. Rev. B , 7(10):4491, 1973

    work page 1973

  8. [7]

    Holehouse and S

    J. Holehouse and S. Redner. First passage on disordered intervals. Phys. Rev. E , 109:L032102, Mar 2024

    work page 2024

Show all 55 references
  1. [8]

    H¨ oll, A

    M. H¨ oll, A. Nissan, B. Berkowitz, and E. Barkai. Big jump principle for first passage times. In Target Search Problems, pages 209–223. Springer, 2024

    2024

  2. [9]

    Luo and L.-H

    L. Luo and L.-H. Tang. Sample-dependent first-passage- time distribution in a disordered medium. Phys. Rev. E , 92(4):042137, 2015

    2015

  3. [11]

    Murthy and K.W

    K.P.N. Murthy and K.W. Kehr. Mean first-passage time of random walks on a random lattice. Phys. Rev. A , 40(4):2082, 1989

  4. [12]

    B´ enichou and R

    O. B´ enichou and R. Voituriez. From first-passage times of random walks in confinement to geometry-controlled kinetics. Phys. Rep., 539(4):225–284, 2014

    2014

  5. [13]

    Tejedor, O

    V. Tejedor, O. B´ enichou, and R. Voituriez. Global mean first-passage times of random walks on complex net- works. Phys. Rev. E , 80(6):065104, 2009

    2009

  6. [14]

    T. G. Mattos, C. Mej ´ ıa-Monasterio, R. Metzler, and G. Oshanin. First passages in bounded domains: When is the mean first passage time meaningful? Phys. Rev. E, 86(3):031143, 2012

    2012

  7. [15]

    Godec and R

    A. Godec and R. Metzler. First passage time distribution in heterogeneity controlled kinetics: going beyond the mean first passage time. Sci. Rep., 6(1):20349, 2016

    2016

  8. [16]

    A. J. Gurfinkel and P. A. Rikvold. Absorbing random walks interpolating between centrality measures on com- plex networks. Phys. Rev. E , 101(1):012302, 2020

    2020

  9. [17]

    White and P

    S. White and P. Smyth. Algorithms for estimating rela- tive importance in networks. In Proc. ACM SIGKDD Int. Conf. Knowl. Discov. Data Min. , pages 266–275, 2003. 7

    2003

  10. [18]

    M. E. J. Newman. A measure of betweenness centrality based on random walks. Soc. Netw., 27(1):39–54, 2005

    2005

  11. [19]

    Bassolas and V

    A. Bassolas and V. Nicosia. First-passage times to quan- tify and compare structural correlations and heterogene- ity in complex systems. Commun. Phys. , 4(1):76, 2021

    2021

  12. [20]

    H. Chen, X. Zhen, X. Gu, H. Yan, L. Cervino, Y. Xiao, and L. Zhou. Sparse: Seed point auto-generation for ran- dom walks segmentation enhancement in medical inho- mogeneous targets delineation of morphological mr and ct images. J. Appl. Clin. Med. Phys. , 16(2):387–402, 2015

    2015

  13. [21]

    Y. Yu, C. Wang, Q. Fu, R. Kou, F. Huang, B. Yang, T. Yang, and M. Gao. Techniques and challenges of im- age segmentation: A review. Electron., 12(5):1199, 2023

    2023

  14. [22]

    J. D. Noh and H. Rieger. Random walks on complex networks. Phys. Rev. Lett. , 92(11):118701, 2004

    2004

  15. [23]

    Mean en- counter times for multiple random walkers on networks

    Alejandro P Riascos and David P Sanders. Mean en- counter times for multiple random walkers on networks. Phys. Rev. E , 103(4):042312, 2021

    2021

  16. [24]

    Giuggioli and S

    L. Giuggioli and S. Sarvaharman. Spatio-temporal dy- namics of random transmission events: from information sharing to epidemic spread. J. Phys. A: Math. Theor. , 55(37):375005, 2022

    2022

  17. [25]

    Masuda, M

    N. Masuda, M. A. Porter, and R. Lambiotte. Random walks and diffusion on networks. Phys. rep. , 716:1–58, 2017

    2017

  18. [26]

    Bartolucci, F

    S. Bartolucci, F. Caccioli, F. Caravelli, and P. Vivo. ”Spectrally gapped” random walks on networks: a mean first passage time formula. SciPost Phys. , 11(5):088, 2021

    2021

  19. [27]

    Singh and M

    A. Singh and M. D. Humphries. Finding communities in sparse networks. Sci. rep., 5(1):8828, 2015

    2015

  20. [28]

    D. J. Watts and S. H. Strogatz. Collective dynamics of ‘small-world’ networks. Nature, 393(6684):440–442, 1998

    1998

  21. [29]

    L. A. N. Amaral, A. Scala, M. Barthelemy, and H. E. Stanley. Classes of small-world networks. Proc. Natl. Acad. Sci. U.S.A. , 97(21):11149–11152, 2000

    2000

  22. [30]

    Xu and D

    Z. Xu and D. Z. Sui. Small-world characteristics on trans- portation networks: a perspective from network autocor- relation. J. Geogr. Syst. , 9:189–205, 2007

    2007

  23. [31]

    Zarepour, J

    M. Zarepour, J. I. Perotti, O. V. Billoni, D. R. Chialvo, and S. A. Cannas. Universal and nonuniversal neural dy- namics on small world connectomes: A finite-size scaling analysis. Phys. Rev. E , 100(5):052138, 2019

    2019

  24. [32]

    Lachgar and A

    A. Lachgar and A. Achahbar. Uncovering the hidden structure of small-world networks. Sci. Rep., 14(1):6555, 2024

    2024

  25. [33]

    Almaas, R

    E. Almaas, R. V. Kulkarni, and D. Stroud. Scaling prop- erties of random walks on small-world networks. Phys. Rev. E, 68(5):056105, 2003

    2003

  26. [34]

    P. E. Parris and V. M. Kenkre. Traversal times for random walks on small-world networks. Phys. Rev. E , 72(5):056119, 2005

    2005

  27. [35]

    Almaas, R

    E. Almaas, R. V. Kulkarni, and D. Stroud. Characteriz- ing the structure of small-world networks. Phys. Rev. E , 88(9):098101, 2002

    2002

  28. [36]

    D. H. Zanette. Dynamics of rumor propagation on small- world networks. Phys. Rev. E , 65(4):041908, 2002

    2002

  29. [37]

    H. Wang, J. M. Moore, M. Small, J. Wang, H. Yang, and C. Gu. Epidemic dynamics on higher-dimensional small world networks. Appl. Math. Comput., 421:126911, 2022

    2022

  30. [38]

    S. A. Pandit and R. E. Amritkar. Random spread on the family of small-world networks. Phys. Rev. E , 63(4):041104, 2001

    2001

  31. [39]

    First passage time for random walks in heterogeneous networks

    S Hwang, D-S Lee, and B Kahng. First passage time for random walks in heterogeneous networks. Phys. Rev. Lett., 109(8):088701, 2012

    2012

  32. [40]

    D Hughes

    B. D Hughes. Random walks and random environments . Oxford University Press, 1996

    1996

  33. [41]

    E. W. Montroll and G. H. Weiss. Random walks on lattices. ii. J. Math. Phys. , 6(2):167–181, 1965

    1965

  34. [42]

    Giuggioli

    L. Giuggioli. Exact spatiotemporal dynamics of confined lattice random walks in arbitrary dimensions: A century after Smoluchowski and P´ olya.Phys. Rev. X, 10:021045, 2020

    2020

  35. [43]

    See Supplemental Material at [url will be inserted by publisher] for further details on the derivations

  36. [44]

    V. M. Kenkre. Memory functions, projection operators, and the defect technique: some tools of the trade for the condensed matter physicist , volume 982. Springer Na- ture, 2021

    2021

  37. [45]

    S. Redner. A guide to first-passage processes. Cambridge university press, 2001

    2001

  38. [46]

    E. W. Dijkstra. A note on two problems in connexion with graphs. Numer. math. , 1(1):269–271, 1959

    1959

  39. [47]

    Both the neighbour to be cut and the node to choose from are drawn from a uniform distribution over the available nodes

  40. [48]

    Fairbanks, M

    J. Fairbanks, M. Besan¸ con, S. Simon, J. Hoffiman, N. Eu- bank, and S. Karpinski. Juliagraphs/graphs.jl: an op- timized graphs package for the julia programming lan- guage, 2021

    2021

  41. [49]

    Hagberg, P

    A. Hagberg, P. J. Swart, and D. A. Schult. Exploring network structure, dynamics, and function using net- workx. Technical report, Los Alamos National Labora- tory (LANL), Los Alamos, NM (United States), 2008

    2008

  42. [50]

    Godec and R

    A. Godec and R. Metzler. Universal proximity effect in target search kinetics in the few-encounter limit. Phys. Rev. X, 6(4):041037, 2016

    2016

  43. [51]

    A. E. Brouwer, W. H. Haemers, A. E. Brouwer, and W. H. Haemers. Strongly regular graphs. Spectra of graphs, pages 115–149, 2012

    2012

  44. [52]

    M. J. Lighthill. An introduction to Fourier analysis and generalised functions. Cambridge University Press, 1958

    1958

  45. [53]

    V. Sood, S. Redner, and D. Ben-Avraham. First-passage properties of the erd˝ os–renyi random graph.J. Phys. A: Math. Theor., 38(1):109, 2004

    2004

  46. [54]

    Abate and W

    J. Abate and W. Whitt. The fourier-series method for in- verting transforms of probability distributions. Queueing Syst., 10:5–87, 1992

    1992

  47. [55]

    |n − n0| ln 3 + √ 5 2 !#) + (−1)n−n0 sinh

    Luca Giuggioli, Sebastian P´ erez-Becker, and David P Sanders. Encounter times in overlapping domains: Ap- plication to epidemic spread¡? format?¿ in a population of territorial animals. Phys. Rev. Lett. , 110(5):058103, 2013. 1 Supplemental Materials: Predicting First-Passage...

    2013

Pith tools

Reviewed August 5, 2026 · model on record in the stance chip above.