Pith.

Probability · arXiv:2611.17234 v1 · submitted 12 Nov 2026 · 75 references

Mean-field Fluctuations for First-Passage Percolation with Symmetric Kernels

Partha S. Dey, Daecheol Kim

The paper says

“We study first-passage percolation on finite weighted graphs whose normalized Weibull edge hazards form a symmetric Markov kernel on N vertices.”

more of the abstract

We prove that a uniform absolute spectral gap and an O(N−1) bound on a fixed even-step return probability imply the stochastic mean-field passage-time limit and an independent Gaussian hopcount limit. Jointly with these quantities, the entire geodesic from an arbitrary source to an independent uniform target is approximated in total variation by an independent Markov chain stopped at the hopcount. This comparison yields laws of large numbers for fixed-length path segments and joint central limit theorems for bounded additive observables. The results extend to edge laws with a uniform relative hazard error o(1/logN), including common noise distributions with a power-law hazard and a positive-power error near zero. Applications include integrable singular torus kernels, macroscopic spread-out graphs, non-transitive regular graphs, finite groups, and discretizations of symmetric continuum kernels.

from the abstract

Pith says

Machine review · deepseek-v4-flash · 13 Nov 2026 · what was read was not recorded · not checked by a person

It can be wrong. Challenge this review or reply to it.

Spectral conditions for mean-field FPP: a clean, technically solid paper that does what it says, with one real soft spot (constant row sums) that the authors acknowledge but whose practical reach is narrower than the title suggests. This line is wrong

the referee pass did not run

How often objections from reviews like this one are right: not yet measured

Are you an author? What you can do.

Not checked: figures, code, what the 75 references say.

What would settle it

Construct a family of symmetric kernels g_N on N vertices with row sums S_N(x) = 1 + delta_N(x) where max_x |delta_N(x)| = c / log N for a small constant c > 0, and with uniform spectral gap and return bound as in Assumption 1.3. Apply the normalization of Lemma A.1 to obtain a constant-row-sum kernel PN. Compute the entrywise relative error |PN(x,y) / (g_N(x,y)/S_N) - 1| for edges with non-negligible weight. If this error is not o(1/log N) uniformly over all edges, then simulate or analytically bound the total variation distance between the geodesic label distribution and the PN-Markov chain. If the distance does not tend to zero, the path comparison (10) fails for this family, showing that Assumption 1.2 cannot be relaxed to near-constant row sums without additional entrywise control.

from the skeptic's reading

How the review went

3 readings by deepseek-v4-flash · 13 Nov 2026

  1. Reader holds up confidence high
  2. Skeptic agrees: says it holds up only with conditions 12 s · 49,409 tokens read, 1,157 written Assumption 1.2 (constant row sums) is used throughout the proofs but is not automatically satisfied for many natural spatial kernels; the paper's own Proposition 2.2 and Lemma A.1 provide normalization schemes, but these introduce a relative error that may accumulate in the path comparison and…
  3. Editor wrote the verdict above 9 s · 50,485 tokens read, 744 written

Not run on this paper: the referee, the simulated authors' defence.

Pith did not check this review's objections against the paper.

The review in full

The review in brief, machine-written

This is a serious paper. It gives sufficient conditions—a uniform spectral gap and an O(1/N) even-step return bound—for a finite symmetric Markov kernel to produce the same mean-field passage-time, hopcount, and geodesic limits as the complete graph. The main result (Theorem 1.4) is new and the proof is rigorous. The two-source branching framework from the authors' earlier work is extended cleanly to finite kernels, and the spatial mixing estimates (Proposition 6.1) are the technical core. The applications section is extensive and honestly worked out.

The soft spot is Assumption 1.2: constant row sums. The paper acknowledges this is strong and provides normalization schemes (Proposition 2.2, Lemma A.1) that introduce a relative error controlled only in operator norm and row-sum, not entrywise. The stress-test note worries that this error may accumulate in the path comparison (10) and the hopcount CLT. On reading the paper, I think the concern is real but not fatal: the proof of Lemma 7.1 (path comparison) uses the identity (62) which relies on PN being exactly the transition matrix of the labels in the unpruned trees. If the physical edge weights are normalized by a different kernel (e.g., QN in Proposition 2.2), the labels in the CMJ trees evolve according to PN, but the actual edge hazards in the FPP model are proportional to QN(x,y) (or the original gN(x,y)). The paper's Corollary 2.3 asserts that the conclusions of Theorem 1.6 hold with reference kernel PN and normalizer c1/θ aN, but the proof of Theorem 1.6 (Section 8) assumes that the dominating CMJ trees use PN as the label transition matrix and that the physical hazards are approximated by PN up to a relative error εN = o(1/log N). When the row sums are not constant, the normalization to constant row sums changes the off-diagonal entries by a factor that may vary across edges. The paper's Lemma A.1 controls this variation only in L1 row sum, not entrywise. The path comparison (10) requires that the law of the geodesic labels be close in total variation to a PN-Markov chain. If the physical transition probabilities differ from PN by a spatially varying factor that is not uniformly o(1/log N) in the sup norm, the total variation distance may not vanish.

That said, the paper is mathematically honest: it states the assumption, gives examples where it holds, and provides a perturbation result for near-constant row sums. The central argument holds up under the stated conditions. The paper is for specialists in random metric spaces and first-passage percolation who want a unified spectral condition for mean-field behavior. It deserves a serious referee.

Recommendation: send to peer review. The referee should check the path comparison step carefully, especially the transition from the normalized kernel to the physical edge weights in the non-constant row sum case. But the paper is solid and the contribution is real.

The strongest objection

The central claim (Theorem 1.4) requires Assumption 1.2: the row sums S_N(x) = sum_{y != x} g_N(x,y) must be constant across vertices. The paper acknowledges this is a strong symmetry condition and provides Proposition 2.2 and Lemma A.1 to normalize kernels with small diagonal or near-constant row sums. However, the error introduced by these normalizations is controlled only in operator norm and entrywise, not in the quantities that enter the path comparison (10) and the hopcount CLT. Specifically, the reference kernel PN in (21) differs from the physical off-diagonal weights by a factor b_N(x)b_N(y) that is close to 1 but not exactly 1. The proof of Lemma 7.1 (path comparison) uses the identity (62) which relies on PN being exactly the transition matrix of the labels in the unpruned trees. If the physical edge weights are normalized by a different kernel (e.g., QN in Proposition 2.2), the labels in the CMJ trees evolve according to PN, but the actual edge hazards in the FPP model are proportional to QN(x,y) (or the original g_N(x,y)). The paper's Corollary 2.3 asserts that the conclusions of Theorem 1.6 hold with reference kernel PN and normalizer c^{1/theta} a_N, but the proof of Theorem 1.6 (Section 8) assumes that the dominating CMJ trees use PN as the label transition matrix and that the physical hazards are approximated by PN up to a relative error epsilon_N = o(1/log N). When the row sums are not constant, the normalization to constant row sums changes the off-diagonal entries by a factor that may vary across edges. The paper's Lemma A.1 controls this variation only in L^1 row sum, not entrywise. The path comparison (10) requires that the law of the geodesic labels be close in total variation to a PN-Markov chain. If the physical transition probabilities differ from PN by a spatially varying factor that is not uniformly o(1/log N) in the sup norm, the total variation distance may not vanish.

The reader's weakest_assumption correctly identifies Assumption 1.2 (constant row sums) as the most restrictive condition. The paper provides normalization tools (Proposition 2.2, Lemma A.1) to handle near-constant row sums, but the error analysis in these tools is in operator norm and row-sum L^1, not in entrywise relative error. The path comparison (10) and the hopcount CLT rely on the labels in the CMJ trees evolving exactly according to PN, while the physical edge hazards are proportional to the original g_N(x,y). The paper's Theorem 1.6 and Corollary 2.3 claim universality for edge laws with a uniform relative hazard error o(1/log N), but this condition is applied to the normalized kernel PN, not to the original g_N. The step from near-constant row sums to a constant-row-sum PN introduces an entrywise error that may not be o(1/log N) uniformly, especially for kernels with spatially varying row sums that are not captured by the L^1 row-sum bound. This is a load-bearing concern because the path comparison is a central result and the paper explicitly discusses non-constant row sums as a direction for future work (citing [28]). The concrete test would settle whether the normalization suffices for the full path law or whether additional entrywise control is needed. The verdict should be CONDITIONAL: accept subject to verification that the normalization error is uniformly o(1/log N) entrywise, or that the path comparison holds under weaker entrywise control.

Pith's reading of the paper (a machine's summary, not the authors')

First-passage percolation models the spread of a fluid or infection through a random medium: each edge has a random length, and we study the shortest path between two vertices. On the complete graph with Weibull edge lengths, the typical distance and the number of steps (hopcount) have known limits. This paper asks which other graphs share those limits. The answer is given by two conditions on the normalized edge intensity matrix: a uniform absolute spectral gap (the random walk mixes quickly) and a bound on the probability that the walk returns to its starting point after a fixed even number of steps. Under these conditions, the rescaled passage time and hopcount converge to the same limits as on the complete graph, and the entire geodesic (the sequence of vertices along the shortest path) is approximated in total variation by a Markov chain with the same transition kernel, stopped at the hopcount. The result applies to many spatial structures: torus kernels with power-law decay, spread-out graphs, finite groups, and discretizations of continuum kernels. The proof uses a two-source branching process exploration and spectral mixing estimates. The paper also extends the result to edge weight distributions that are close to Weibull near zero.

Core claim. Under Assumptions 1.1, 1.2, and 1.3 (Weibull edge weights, constant row sums, uniform spectral gap and O(N^{-1}) even-step return probability), the centered passage time T_N and the normalized hopcount converge jointly to (Y_theta, Z) where Y_theta is a Gumbel-type limit and Z is standard normal, independent. Moreover, the entire geodesic from an arbitrary source to an independent uniform target is approximated in total variation by an independent Markov chain stopped at the hopcount (Theorem 1.4).

The premise it rests on. Assumption 1.2 requires that the row sums S_N(x) = sum_{y != x} g_N(x,y) are constant across vertices x. This is a strong symmetry condition: the total edge intensity from each vertex must be the same. While the paper shows this can be achieved by symmetric normalization (Proposition 2.2) for many models, it is not automatically satisfied for arbitrary spatial kernels. The assumption is used throughout the branching and mixing estimates, and relaxing it would require additional analysis (as noted in the paper, citing [28] for nonconstant row sums).

Check this review

Pith stored no record of this review's passes and took no fingerprint of it. Reviews made by code from 13 Nov 2026 on carry both.

How often reviews like this one are right

Reviews like this one: written by deepseek-v4-flash, where what was read was not recorded.

How often objections from reviews like this one are right: not yet measured

Every value above, in the review's public record (JSON)

Reviews by people

This review was written by a machine. No person has reviewed this paper on Pith yet. A scientist listed on Pith can review it for a fee, and their review is published here whatever it concludes.

Request a human review

How Pith checks papers · The full audit of this paper

The paper

Abstract

We study first-passage percolation on finite weighted graphs whose normalized Weibull edge hazards form a symmetric Markov kernel on N vertices. We prove that a uniform absolute spectral gap and an O(N−1) bound on a fixed even-step return probability imply the stochastic mean-field passage-time limit and an independent Gaussian hopcount limit. Jointly with these quantities, the entire geodesic from an arbitrary source to an independent uniform target is approximated in total variation by an independent Markov chain stopped at the hopcount. This comparison yields laws of large numbers for fixed-length path segments and joint central limit theorems for bounded additive observables. The results extend to edge laws with a uniform relative hazard error o(1/logN), including common noise distributions with a power-law hazard and a positive-power error near zero. Applications include integrable singular torus kernels, macroscopic spread-out graphs, non-transitive regular graphs, finite groups, and discretizations of symmetric continuum kernels.

The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. No sentence in this record was written by a model.

abstract compiled · 2026-11-14

The authors' main claim, as the classifier picked it out 0.92

“We prove that a uniform absolute spectral gap and an $O(N^{-1})$ bound on a fixed even-step return probability imply the stochastic mean-field passage-time limit and an independent Gaussian hopcount limit.”

How the main claim is stated: asserted 1.00

What the abstract itself states, as probabilities: claims first 0.03 · states limitation 0.47 · human participants 0.01 · controlled comparison 0.12 · randomized assignment 0.02 · states quantitative result 0.97 · compares with prior results 0.11 · mentions code or data availability 0.02

The abstract, sentence by sentence

This table labels the abstract only (arXiv listing abstract v1). The number is the probability the classifier gave the label.

SentenceRoleThe authors' own workStates the main conclusionStrength
We study first-passage percolation on finite weighted graphs whose normalized Weibull edge hazards form a symmetric Markov kernel on $N$ vertices. contribution 0.68 0.69 0.03 asserted 0.86
We prove that a uniform absolute spectral gap and an $O(N^{-1})$ bound on a fixed even-step return probability imply the stochastic mean-field passage-time limit and an independent Gaussian hopcount limit. result 0.97 0.93 0.72 asserted 1.00
Jointly with these quantities, the entire geodesic from an arbitrary source to an independent uniform target is approximated in total variation by an independent Markov chain stopped at the hopcount. result 0.99 0.89 0.24 asserted 1.00
This comparison yields laws of large numbers for fixed-length path segments and joint central limit theorems for bounded additive observables. result 0.72 0.90 0.10 asserted 1.00
The results extend to edge laws with a uniform relative hazard error $o(1/\log N)$, including common noise distributions with a power-law hazard and a positive-power error near zero. result 0.90 0.89 0.06 asserted 1.00
Applications include integrable singular torus kernels, macroscopic spread-out graphs, non-transitive regular graphs, finite groups, and discretizations of symmetric continuum kernels. interpretation 0.49 0.65 0.04 asserted 1.00

What kind of paper the classifier reports this is: theoretical result 1.00 · evidence from proof or derivation 1.00

What was examined, and what was not

Sources read

  • arXiv listing abstract v1

Not examined

  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers

Levels run

  • P abstract

Not run

  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

How the labels were made

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-11-14: 1 request, 5,031 input tokens.

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. This record as JSON

References (75)
  1. [1] D. Ahlberg. Asymptotics of first-passage percolation on one-dimensional graphs.Adv. in Appl. Probab., 47(1):182– 209, 2015 on Pith
  2. [2] M. Aizenman and C. M. Newman. Discontinuity of the percolation density in one-dimensional1/|x−y| 2 percolation models.Comm. Math. Phys., 107(4):611–647, 1986 on Pith
  3. [3] D. Aldous and J. M. Steele. The objective method: probabilistic combinatorial optimization and local weak convergence. In H. Kesten, editor,Probability on Discrete Structures, volume 110 ofEncyclopaedia Math. Sci., pages 1–72. Springer, Berlin, 2004 on Pith
  4. [4] H. Amini and M. Lelarge. The diameter of weighted random graphs.Ann. Appl. Probab., 25(3):1686–1727, 2015 on Pith
  5. [5] K. B. Athreya and P. E. Ney.Branching Processes, volume 196 ofGrundlehren der mathematischen Wissenschaften. Springer, Berlin, 1972 on Pith
  6. [6] A. Auffinger, M. Damron, and J. Hanson.50 Years of First-Passage Percolation, volume 68 ofUniversity Lecture Series. Amer. Math. Soc., Providence, RI, 2017 on Pith
  7. [7] A. D. Barbour and G. Reinert. Small worlds.Random Structures Algorithms, 19:54–74, 2001. Correction: Random Structures Algorithms 25 (2004), no. 1, 115; doi:10.1002/rsa.20028 on Pithdoi:10.1002/rsa.20028
  8. [8] A. D. Barbour and G. Reinert. Discrete small world networks.Electron. J. Probab., 11(47):1234–1283, 2006 on Pith
  9. [9] A. D. Barbour and G. Reinert. Asymptotic behaviour of gossip processes and small-world networks.Adv. in Appl. Probab., 45(4):981–1010, 2013 on Pith
  10. [10] M. Barthélemy. Spatial networks.Phys. Rep., 499(1–3):1–101, 2011 on Pith
  11. [11] I. Benjamini and N. Berger. The diameter of long-range percolation clusters on finite cycles.Random Structures Algorithms, 19(2):102–111, 2001 on Pith
  12. [12] N. Berger. Transience, recurrence and critical behavior for long-range percolation.Comm. Math. Phys., 226(3):531– 558, 2002 on Pith
  13. [13] N. Berger. A lower bound for the chemical distance in sparse long-range percolation models. Preprint, arXiv:math/0409021, 2004 on PithPith's reviewarXiv
  14. [14] S. Bhamidi. First passage percolation on locally treelike networks. I. Dense random graphs.J. Math. Phys., 49(12):125218, 2008 on Pith
  15. [15] S. Bhamidi and R. van der Hofstad. Weak disorder asymptotics in the stochastic mean-field model of distance. Ann. Appl. Probab., 22(1):29–69, 2012. 38 DEY AND KIM on Pith
  16. [16] S. Bhamidi and R. van der Hofstad. Diameter of the stochastic mean-field model of distance.Combin. Probab. Comput., 26(6):797–825, 2017 on Pith
  17. [17] S. Bhamidi, R. van der Hofstad, and G. Hooghiemstra. First passage percolation on random graphs with finite mean degrees.Ann. Appl. Probab., 20(5):1907–1965, 2010 on Pith
  18. [18] S. Bhamidi, R. van der Hofstad, and G. Hooghiemstra. First passage percolation on the Erdős–Rényi random graph.Combin. Probab. Comput., 20(5):683–707, 2011 on Pith
  19. [19] S. Bhamidi, R. van der Hofstad, and G. Hooghiemstra. Universality for first passage percolation on sparse random graphs.Ann. Probab., 45(4):2568–2630, 2017 on Pith
  20. [20] S. Bhamidi, R. van der Hofstad, and J. Komjáthy. The front of the epidemic spread and first passage percolation. J. Appl. Probab., 51A:101–121, 2014 on Pith
show 55 more
  1. [21] J. D. Biggins. The growth and spread of the general branching random walk.Ann. Appl. Probab., 5(4):1008–1024, 1995 on Pith
  2. [22] M. Biskup. On the scaling of the chemical distance in long-range percolation models.Ann. Probab., 32(4):2938–2977, 2004 on Pith
  3. [23] B. Bollobás, C. Borgs, J. Chayes, and O. Riordan. Percolation on dense graph sequences.Ann. Probab., 38(1):150– 183, 2010 on Pith
  4. [24] B. Bollobás, S. Janson, and O. Riordan. The phase transition in inhomogeneous random graphs.Random Structures Algorithms, 31(1):3–122, 2007 on Pith
  5. [25] L. Brandolini, C. Choirat, L. Colzani, G. Gigante, R. Seri, and G. Travaglini. Quadrature rules and distribution of points on manifolds.Ann. Sc. Norm. Super. Pisa Cl. Sci., 13(4):889–923, 2014 on Pith
  6. [26] S. Chatterjee and P. S. Dey. Central limit theorem for first-passage percolation time across thin cylinders.Probab. Theory Related Fields, 156(3-4):613–663, 2013 on Pith
  7. [27] S. Chatterjee and P. S. Dey. Multiple phase transitions in long-range first-passage percolation on square lattices. Comm. Pure Appl. Math., 69(2):203–256, 2016 on Pith
  8. [28] S. Chatterjee, P. S. Dey, and D. Kim. Inhomogeneous long-range first-passage percolation in a random vertex environment. Preprint, arXiv:2609.20422, 2026 on PithPith's reviewarXiv
  9. [29] S. Chatterjee and R. Durrett. Asymptotic behavior of Aldous’ gossip process.Ann. Appl. Probab., 21(6):2447–2482, 2011 on Pith
  10. [30] D. Coppersmith, D. Gamarnik, and M. Sviridenko. The diameter of a long-range percolation graph.Random Structures Algorithms, 21:1–13, 2002 on Pith
  11. [31] F. Daly, M. Schulte, and S. Shneer. First passage percolation on Erdős–Rényi graphs with general weights.Ann. Appl. Probab., 35(6):4213–4243, 2025 on Pith
  12. [32] E. B. Davies.Heat Kernels and Spectral Theory, volume 92 ofCambridge Tracts in Mathematics. Cambridge University Press, Cambridge, 1989 on Pith
  13. [33] M. Deijfen, R. van der Hofstad, and G. Hooghiemstra. Scale-free percolation.Ann. Inst. Henri Poincaré Probab. Stat., 49(3):817–838, 2013 on Pith
  14. [34] P. S. Dey and D. Kim. First-passage percolation on spread-out line graphs: microscopic regime. Preprint, arXiv:2607.28865, 2026 on PithPith's reviewarXiv
  15. [35] P. S. Dey and D. Kim. Phase transition and fluctuation results for first-passage percolation on spread-out cycle graphs. Preprint, arXiv:2609.00110, 2026 on PithPith's reviewarXiv
  16. [36] P. Diaconis.Group Representations in Probability and Statistics, volume 11 ofIMS Lecture Notes–Monograph Series. Inst. Math. Statist., Hayward, CA, 1988 on Pith
  17. [37] E. W. Dijkstra. A note on two problems in connexion with graphs.Numer. Math., 1(1):269–271, 1959 on Pith
  18. [38] J. Ding and A. Sly. Distances in critical long range percolation. Preprint, arXiv:1303.3995, 2013 on PithPith's reviewarXiv
  19. [39] M. Eckhoff, J. Goodman, R. van der Hofstad, and F. R. Nardi. Short paths for first passage percolation on the complete graph.J. Stat. Phys., 151(6):1056–1088, 2013 on Pith
  20. [40] M. Eckhoff, J. Goodman, R. van der Hofstad, and F. R. Nardi. Long paths in first passage percolation on the complete graph I. Local PWIT dynamics.Electron. J. Probab., 25:Paper No. 85, 45 pp., 2020 on Pith
  21. [41] M. Eckhoff, J. Goodman, R. van der Hofstad, and F. R. Nardi. Long paths in first passage percolation on the complete graph II. Global branching dynamics.J. Stat. Phys., 181(2):364–447, 2020 on Pith
  22. [42] A. M. Frieze and G. R. Grimmett. The shortest-path problem for graphs with random arc-lengths.Discrete Appl. Math., 10(1):57–77, 1985 on Pith
  23. [43] G. Gigante and P. Leopardi. Diameter bounded equal measure partitions of Ahlfors regular metric measure spaces. Discrete Comput. Geom., 57(2):419–430, 2017 on Pith
  24. [44] R. Gorenflo, A. A. Kilbas, F. Mainardi, and S. V. Rogosin.Mittag-Leffler Functions, Related Topics and Applications. Springer Monographs in Mathematics. Springer, Berlin, 2014 on Pith
  25. [45] P. Gracar, A. Grauer, and P. Mörters. Chemical distance in geometric random graphs with long edges and scale-free degree distribution.Comm. Math. Phys., 395(2):859–906, 2022. MEAN-FIELD FLUCTUATIONS AND GEODESICS 39 on Pith
  26. [46] P. Hall and C. C. Heyde.Martingale Limit Theory and Its Application. Probability and Mathematical Statistics. Academic Press, New York, 1980 on Pith
  27. [47] J. M. Hammersley and D. J. A. Welsh. First-passage percolation, subadditive processes, stochastic networks, and generalized renewal theory. In J. Neyman and L. M. Le Cam, editors,Bernoulli 1713, Bayes 1763, Laplace 1813, pages 61–110. Springer, Berlin, 1965 on Pith
  28. [48] P. Jagers.Branching Processes with Biological Applications. Wiley, London, 1975 on Pith
  29. [49] P. Jagers and O. Nerman. The growth and composition of branching populations.Adv. in Appl. Probab., 16(2):221–259, 1984 on Pith
  30. [50] S. Janson. One, two and three timeslogn/n for paths in a complete graph with random weights.Combin. Probab. Comput., 8(4):347–361, 1999 on Pith
  31. [51] H. Kesten. Aspects of first passage percolation. In P. L. Hennequin, editor,École d’été de probabilités de Saint-Flour XIV—1984, volume 1180 ofLecture Notes in Math., pages 125–264. Springer, Berlin, 1986 on Pith
  32. [52] J. Kleinberg. The small-world phenomenon: an algorithmic perspective. InProceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC), pages 163–170, New York, 2000. ACM on Pith
  33. [53] S. Klootwijk, B. Manthey, and S. K. Visser. Probabilistic analysis of optimization problems on generalized random shortest path metrics.Theoret. Comput. Sci., 866:107–122, 2021 on Pith
  34. [54] I. Kolossváry and J. Komjáthy. First passage percolation on inhomogeneous random graphs.Adv. in Appl. Probab., 47(2):589–610, 2015 on Pith
  35. [55] J. Komjáthy, J. Lapinskas, J. Lengler, and U. Schaller. Four universal growth regimes in degree-dependent first passage percolation on spatial random graphs.Forum Math. Sigma, 14:Paper No. e22, 2026. Preprint version: arXiv:2309.11840 on PithPith's reviewarXiv
  36. [56] J. Komjáthy and B. Lodewijks. Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs.Stochastic Process. Appl., 130(3):1309–1367, 2020 on Pith
  37. [57] J. Komjáthy and V. Vadon. First passage percolation on the Newman–Watts small world model.J. Stat. Phys., 162(4):959–993, 2016 on Pith
  38. [58] G. Last and M. Penrose.Lectures on the Poisson Process, volume 7 ofInstitute of Mathematical Statistics Textbooks. Cambridge University Press, Cambridge, 2017 on Pith
  39. [59] N. F. Marshall and R. R. Coifman. Manifold learning with bi-stochastic kernels.IMA J. Appl. Math., 84(3):455–482, 2019 on Pith
  40. [60] D. Mollison. Spatial contact models for ecological and epidemic spread.J. Roy. Statist. Soc. Ser. B, 39(3):283–326, on Pith
  41. [61] T. Mountford and J. Saliba. Flooding and diameter in general weighted random graphs.J. Appl. Probab., 57(3):956–980, 2020 on Pith
  42. [62] O. Nerman. On the convergence of supercritical general (C-M-J) branching processes.Z. Wahrsch. Verw. Gebiete, 57(3):365–395, 1981 on Pith
  43. [63] C. M. Newman and L. S. Schulman. One-dimensional1/|j−i| s percolation models: the existence of a transition fors⩽2.Comm. Math. Phys., 104(4):547–571, 1986 on Pith
  44. [64] M. E. J. Newman and D. J. Watts. Renormalization group analysis of the small-world network model.Phys. Lett. A, 263(4–6):341–346, 1999 on Pith
  45. [65] D. Richardson. Random growth in a tessellation.Proc. Cambridge Philos. Soc., 74(3):515–528, 1973 on Pith
  46. [66] L. S. Schulman. Long range percolation in one dimension.J. Phys. A, 16(17):L639–L641, 1983 on Pith
  47. [67] Z. Shi.Branching Random Walks, volume 2151 ofLecture Notes in Math.Springer, Cham, 2015. École d’Été de Probabilités de Saint-Flour XLII—2012 on Pith
  48. [68] R. Sinkhorn and P. Knopp. Concerning nonnegative matrices and doubly stochastic matrices.Pacific J. Math., 21(2):343–348, 1967 on Pith
  49. [69] K. Tikhomirov and P. Youssef. The spectral gap of dense random regular graphs.Ann. Probab., 47(1):362–419, 2019 on Pith
  50. [70] P. Trapman. The growth of the infinite long-range percolation cluster.Ann. Probab., 38(4):1583–1608, 2010 on Pith
  51. [71] R. van der Hofstad.Random Graphs and Complex Networks, volume 2 ofCambridge Series in Statistical and Probabilistic Mathematics. Cambridge University Press, Cambridge, 2024 on Pith
  52. [72] R. van der Hofstad, G. Hooghiemstra, and P. Van Mieghem. First-passage percolation on the random graph. Probab. Engrg. Inform. Sci., 15(2):225–237, 2001 on Pith
  53. [73] R. van der Hofstad and J. Komjáthy. Explosion and distances in scale-free percolation. Preprint, arXiv:1706.02597, 2017 on PithPith's reviewarXiv
  54. [74] R. van der Hofstad and B. Lodewijks. Long-range first-passage percolation on the torus.J. Stat. Phys., 191(9):Paper No. 107, 2024 on Pith
  55. [75] D. J. Watts and S. H. Strogatz. Collective dynamics of ‘small-world’ networks.Nature, 393(6684):440–442, 1998. 40 DEY AND KIM AppendixA.Verification of the kernel criteria We prove the criteria and applications stated in Section 2, and record the discretization estimates used ... on Pith

Challenges and discussion

Disagree with the review, or know something it missed? Leave a comment, or challenge this review formally: a challenge becomes a permanent entry in this paper's record, and its decision is published here.

No comments yet.

Sign in to comment