pith. sign in

arxiv: 2410.02635 · v3 · submitted 2024-10-03 · 🧮 math.PR

Tightness Analysis of First Passage Times of d-Dimensional Branching Random Walk

Jose Blanchet , Zhenyuan Zhang This is my paper

Pith reviewed 2026-05-23 20:06 UTC · model grok-4.3

classification 🧮 math.PR
keywords branching random walkfirst passage timetightnessasymptoticsgenealogycluster structuresupercriticalmulti-scale analysis
0
0 comments X

The pith

The first passage time of a d-dimensional branching random walk to distance x is tight up to an O(1) error term as x tends to infinity.

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

The paper establishes that for a discrete-time non-lattice supercritical branching random walk in R^d, the first passage time to a shifted unit ball at distance x from the origin, conditioned on survival, admits precise asymptotics up to O(1) as x grows large. This tightness result resolves a conjecture left open in earlier work. A sympathetic reader would care because it supplies sharp control on the time required for the process to reach far regions, which governs the long-range spread of branching populations. The argument reduces the d-dimensional problem to a one-dimensional branching random walk and performs a detailed multi-scale study of particle genealogies near its extremes.

Core claim

Given a discrete-time non-lattice supercritical branching random walk in R^d, the first passage time to a shifted unit ball of distance x from the origin, conditioned upon survival, admits precise asymptotics up to O(1) (tightness) as x to infinity. The proof builds on prior analysis and employs a careful multi-scale analysis on the genealogy of particles within distance ≍ log x near extrema of a one-dimensional branching random walk, where the cluster structure plays a crucial role.

What carries the argument

Multi-scale analysis of the genealogy of particles within distance ≍ log x near the extrema of the one-dimensional branching random walk, with cluster structure controlling the O(1) term.

If this is right

  • The first passage time equals its leading asymptotic term plus a tight random variable whose distribution does not spread with x.
  • The conjecture stated in Blanchet-Cai-Mohanty-Zhang (2024) holds for the non-lattice case in any dimension d.
  • The same multi-scale genealogy analysis yields O(1) control on passage times for related models whose one-dimensional projections have the same cluster structure.
  • Conditioned on survival, the time to reach any fixed-shape distant target set is asymptotically equivalent to the time to reach the unit ball.

Where Pith is reading between the lines

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

  • The O(1) tightness supplies the missing ingredient needed to upgrade existing almost-sure growth rates for the frontier into statements with explicit fluctuation bounds.
  • The reduction to one-dimensional extrema suggests that similar tightness statements may hold for branching random walks with continuous-time or lattice displacements once the cluster analysis is adapted.
  • If the tight limiting distribution can be identified explicitly, it would immediately give the exact constant in front of the logarithmic term for the expected passage time.

Load-bearing premise

The multi-scale analysis on the genealogy of particles within distance about log x near extrema of the one-dimensional branching random walk can be carried out without introducing uncontrolled errors that affect the O(1) term.

What would settle it

A direct computation or simulation showing that the centered first passage time has variance that grows unbounded with x, or that its distribution fails to be tight, would falsify the claimed asymptotics.

Figures

Figures reproduced from arXiv: 2410.02635 by Jose Blanchet, Zhenyuan Zhang.

Figure 1
Figure 1. Figure 1: Typical growth pattern of the production number [PITH_FULL_IMAGE:figures/full_fig_p006_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: A typical cluster structure of the (random) set [PITH_FULL_IMAGE:figures/full_fig_p007_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: below illustrates the three parameters ℓ, h, g [PITH_FULL_IMAGE:figures/full_fig_p007_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Dependence relation of the σ-algebras. Arrows indicate that under the probability measure induced by the BRW, any random variable that is measurable with respect to the object being pointed to (i.e., the head of the arrow) can be simulated as a function of random variables measurable with respect to the object pointing from (i.e., the tail of the arrow) along with some independent randomness. Here, F (1) e… view at source ↗
read the original abstract

Given a discrete-time non-lattice supercritical branching random walk in $\mathbb{R}^d$, we investigate its first passage time to a shifted unit ball of a distance $x$ from the origin, conditioned upon survival. We provide precise asymptotics up to $O(1)$ (tightness) for the first passage time as a function of $x$ as $x\to\infty$, thus resolving a conjecture in Blanchet--Cai--Mohanty--Zhang (2024). Our proof builds on the previous analysis of Blanchet--Cai--Mohanty--Zhang (2024) and employs a careful multi-scale analysis on the genealogy of particles within a distance of $\asymp \log x$ near extrema of a one-dimensional branching random walk, where the cluster structure plays a crucial role.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 2 minor

Summary. The manuscript establishes tightness (asymptotics up to O(1)) for the first passage time of a d-dimensional non-lattice supercritical branching random walk to a shifted unit ball at distance x, conditioned on survival, as x→∞. This resolves a conjecture from Blanchet--Cai--Mohanty--Zhang (2024) by extending their analysis via a multi-scale study of particle genealogy within distance ≍ log x near one-dimensional BRW extrema, with cluster structure playing a key role.

Significance. If the result holds, the work supplies a precise O(1) control on first-passage times that was previously unavailable, directly extending the cited prior paper without circular reduction. The explicit use of genealogical multi-scale analysis and cluster decomposition constitutes a technical contribution that strengthens the extreme-value theory for branching random walks.

major comments (1)
  1. [§5] §5 (multi-scale genealogical analysis): the error control for the decomposition of particles within distance ≍ log x near extrema must be shown to remain uniform in the O(1) term; the cluster-counting estimates (around the one-dimensional projection) need an explicit bound demonstrating that any approximation error does not propagate beyond a fixed additive constant into the first-passage asymptotics.
minor comments (2)
  1. The non-lattice assumption is used throughout but its precise invocation in the tightness argument (e.g., in the renewal-type estimates) could be stated more explicitly for readers.
  2. Notation for the shifted unit ball and the conditioning on survival should be recalled once in the introduction for self-contained reading.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their careful reading, positive assessment of the significance of the result, and for identifying a point where the uniformity of error controls in §5 can be made more explicit. We address the major comment below.

read point-by-point responses

  1. Referee: [§5] §5 (multi-scale genealogical analysis): the error control for the decomposition of particles within distance ≍ log x near extrema must be shown to remain uniform in the O(1) term; the cluster-counting estimates (around the one-dimensional projection) need an explicit bound demonstrating that any approximation error does not propagate beyond a fixed additive constant into the first-passage asymptotics.

    Authors: We agree that explicit uniformity of the error terms is essential for the O(1) tightness claim. The multi-scale analysis in §5 already relies on the exponential tail decay of the one-dimensional BRW and the non-lattice assumption to control genealogical decompositions within distance ≍ log x, with cluster structure ensuring that local approximations remain bounded. However, to strengthen the presentation, the revised manuscript will add a dedicated lemma in §5 that derives an explicit constant C (independent of x) bounding the total approximation error from the cluster-counting estimates around the one-dimensional projection. This bound will be obtained by combining the existing moment estimates with a uniform control on the number of clusters via the branching property, confirming that the error contributes at most C to the first-passage time and does not affect the tightness result. revision: yes

Circularity Check

0 steps flagged

No significant circularity; extends prior work via independent multi-scale analysis

full rationale

The derivation resolves a conjecture from Blanchet--Cai--Mohanty--Zhang (2024) by introducing a new multi-scale genealogy analysis on particles within distance ≍ log x near 1D BRW extrema, with cluster structure controlling errors to O(1). This technical step is presented as the novel contribution and does not reduce by construction to the prior paper's fitted quantities or definitions; the self-citation is to the conjecture being resolved rather than a load-bearing uniqueness theorem or ansatz. The paper is therefore self-contained with independent content.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The claim rests on the standard domain assumptions of supercriticality, non-lattice increments, and conditioning on survival, plus the unverified validity of the multi-scale genealogy construction described in the abstract.

axioms (2)
  • domain assumption The branching random walk is discrete-time, non-lattice, and supercritical in R^d
    Explicitly stated as the setting in the abstract.
  • domain assumption Conditioning upon survival does not alter the asymptotic tightness
    The result is stated under this conditioning.

pith-pipeline@v0.9.0 · 5664 in / 1285 out tokens · 25863 ms · 2026-05-23T20:06:19.012239+00:00 · methodology

discussion (0)

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

Reference graph

Works this paper leans on

47 extracted references · 47 canonical work pages

  1. [1]

    Minima in branching random walks.Annals of Probability, 37(3):1044– 1079, 2009

    Louigi Addario-Berry and Bruce Reed. Minima in branching random walks.Annals of Probability, 37(3):1044– 1079, 2009

    work page 2009

  2. [2]

    Convergence in law of the minimum of a branching random walk

    Elie Aïdékon. Convergence in law of the minimum of a branching random walk. Annals of Probability, 41(3A):1362–1426, 2013

    work page 2013

  3. [3]

    Extrema of log-correlated random variables.Advances in Disordered Systems, Random Processes and Some Applications, page 166, 2016

    Louis-Pierre Arguin. Extrema of log-correlated random variables.Advances in Disordered Systems, Random Processes and Some Applications, page 166, 2016

    work page 2016

  4. [4]

    Genealogy of extremal particles of branching brownian motion

    Louis-Pierre Arguin, Anton Bovier, and Nicola Kistler. Genealogy of extremal particles of branching brownian motion. Communications on Pure and Applied Mathematics, 64(12):1647–1676, 2011

    work page 2011

  5. [5]

    Courier Corporation, 2004

    Krishna B Athreya and Peter E Ney.Branching Processes. Courier Corporation, 2004

    work page 2004

  6. [6]

    The extremal point process of branching brownian motion inRd

    Julien Berestycki, Yujin H Kim, Eyal Lubetzky, Bastien Mallein, and Ofer Zeitouni. The extremal point process of branching brownian motion inRd. The Annals of Probability, 52(3):955–982, 2024

    work page 2024

  7. [7]

    The maximal displacement of radially symmetric branching random walk in Rd

    Viktor Bezborodov and Nina Gantert. The maximal displacement of radially symmetric branching random walk in Rd. arXiv preprint arXiv:2309.14738, 2023

    work page arXiv 2023

  8. [8]

    On the first passage times of branching random walks inRd

    Jose Blanchet, Wei Cai, Shaswat Mohanty, and Zhenyuan Zhang. On the first passage times of branching random walks inRd. arXiv preprint arXiv:2404.09064, 2024

    work page arXiv 2024

  9. [9]

    Convergence in law of the maximum of nonlattice branching random walk.Annales de l’Institut Henri Poincaré - Probabilités et Statistiques, 52(4):1897–1924, 2016

    Maury Bramson, Jian Ding, and Ofer Zeitouni. Convergence in law of the maximum of nonlattice branching random walk.Annales de l’Institut Henri Poincaré - Probabilités et Statistiques, 52(4):1897–1924, 2016

    work page 1924

  10. [10]

    Tightness for a family of recursion equations

    Maury Bramson and Ofer Zeitouni. Tightness for a family of recursion equations. Annals of Probability, 37(2):615–653, 2009

    work page 2009

  11. [11]

    Large deviation estimates for branching random walks.ESAIM: Probability and Statistics, 23:823–840, 2019

    Dariusz Buraczewski and Mariusz Maślanka. Large deviation estimates for branching random walks.ESAIM: Probability and Statistics, 23:823–840, 2019

    work page 2019

  12. [12]

    The structure of extreme level sets in branching brownian motion

    Aser Cortines, Lisa Hartung, and Oren Louidor. The structure of extreme level sets in branching brownian motion. The Annals of Probability, 47(4):2257–2302, 2019

    work page 2019

  13. [13]

    More on the structure of extreme level sets in branching brownian motion.Electronic Communications in Probability, 26(2):1–14, 2021

    Aser Cortines, Lisa Hartung, and Oren Louidor. More on the structure of extreme level sets in branching brownian motion.Electronic Communications in Probability, 26(2):1–14, 2021

    work page 2021

  14. [14]

    Springer, 1998

    Amir Dembo and Ofer Zeitouni.Large Deviations Techniques and Applications. Springer, 1998

    work page 1998

  15. [15]

    Random walks in cones.Annals of Probability, 43(3):992–1044, 2015

    Denis Denisov and Vitali Wachtel. Random walks in cones.Annals of Probability, 43(3):992–1044, 2015

    work page 2015

  16. [16]

    On the large time behaviour of the multi-dimensional Fisher–KPP equation with compactly supported initial data.Nonlinearity, 28(4):1043, 2015

    Arnaud Ducrot. On the large time behaviour of the multi-dimensional Fisher–KPP equation with compactly supported initial data.Nonlinearity, 28(4):1043, 2015

    work page 2015

  17. [17]

    The wave of advance of advantageous genes.Annals of Eugenics, 7(4):355–369, 1937

    Ronald Aylmer Fisher. The wave of advance of advantageous genes.Annals of Eugenics, 7(4):355–369, 1937

    work page 1937

  18. [18]

    Large deviations for the maximum of a branching random walk

    Nina Gantert and Thomas Höfelsauer. Large deviations for the maximum of a branching random walk. Electronic Communications in Probability, 23(34):1–12, 2018

    work page 2018

  19. [19]

    Location of wave fronts for the multi-dimensional K-P-P equation and Brownian first exit densities

    Jürgen Gärtner. Location of wave fronts for the multi-dimensional K-P-P equation and Brownian first exit densities. Mathematische Nachrichten, 105(1):317–351, 1982. 39

    work page 1982

  20. [20]

    Ion Grama and Hui Xiao. Conditioned local limit theorems for random walks on the real line.arXiv preprint arXiv:2110.05123, to appear in Annales de l’Institut Henri Poincaré - Probabilités et Statistiques, 2024

    work page arXiv 2024

  21. [21]

    On the growth of the extremal and cluster level sets in branching brownian motion.arXiv preprint arXiv:2405.17634, 2024

    Lisa Hartung, Oren Louidor, and Tianqi Wu. On the growth of the extremal and cluster level sets in branching brownian motion.arXiv preprint arXiv:2405.17634, 2024

    work page arXiv 2024

  22. [22]

    How big is the minimum of a branching random walk?Annales de l’Institut Henri Poincaré - Probabilités et Statistiques, 52:233–260, 2016

    Yueyun Hu. How big is the minimum of a branching random walk?Annales de l’Institut Henri Poincaré - Probabilités et Statistiques, 52:233–260, 2016

    work page 2016

  23. [23]

    Minimal position and critical martingale convergence in branching random walks, and directed polymers on disordered trees.Annals of Probability, 37(2):742–789, 2009

    Yueyun Hu and Zhan Shi. Minimal position and critical martingale convergence in branching random walks, and directed polymers on disordered trees.Annals of Probability, 37(2):742–789, 2009

    work page 2009

  24. [24]

    Maximums on trees

    Predrag R Jelenković and Mariana Olvera-Cravioto. Maximums on trees. Stochastic Processes and their Applications, 125(1):217–232, 2015

    work page 2015

  25. [25]

    Springer, 2014

    Ioannis Karatzas and Steven Shreve.Brownian Motion and Stochastic Calculus, volume 113. Springer, 2014

    work page 2014

  26. [26]

    The maximum of branching Brownian motion inRd

    Yujin H Kim, Eyal Lubetzky, and Ofer Zeitouni. The maximum of branching Brownian motion inRd. The Annals of Applied Probability, 33(2):1515–1568, 2023

    work page 2023

  27. [27]

    The shape of the front of multidimensional branching brownian motion.arXiv preprint arXiv:2401.12431, 2024

    Yujin H Kim and Ofer Zeitouni. The shape of the front of multidimensional branching brownian motion.arXiv preprint arXiv:2401.12431, 2024

    work page arXiv 2024

  28. [28]

    Étude de l’équation de la diffusion avec croissance de la quantité de matière et son application à un problème biologigue.Moscow Univ

    Andrei Kolmogorov, Ivan Petrovskii, and Nikolai Piskunov. Étude de l’équation de la diffusion avec croissance de la quantité de matière et son application à un problème biologigue.Moscow Univ. Bull. Ser. Internat. Sect. A, 1:1, 1937

    work page 1937

  29. [29]

    Branching random walks in random environment: a survey

    Wolfgang König. Branching random walks in random environment: a survey. InProbabilistic Structures in Evolution, pages 23–41. EMS Press, Berlin, 2021

    work page 2021

  30. [30]

    Stochasticity, invasions, and branching random walks

    Mark Kot, Jan Medlock, Timothy Reluga, and D Brian Walton. Stochasticity, invasions, and branching random walks. Theoretical Population Biology, 66(3):175–184, 2004

    work page 2004

  31. [31]

    Precise upper deviation estimates for the maximum of a branching random walk.arXiv preprint arXiv:2403.03687, 2024

    Lianghui Luo. Precise upper deviation estimates for the maximum of a branching random walk.arXiv preprint arXiv:2403.03687, 2024

    work page arXiv 2024

  32. [32]

    Convergence in law for the branching random walk seen from its tip.Journal of Theoretical Probability, 30:27–63, 2017

    Thomas Madaule. Convergence in law for the branching random walk seen from its tip.Journal of Theoretical Probability, 30:27–63, 2017

    work page 2017

  33. [33]

    Maximal displacement in thed-dimensional branching Brownian motion.Electronic Com- munications in Probability, 20:1–12, 2015

    Bastien Mallein. Maximal displacement in thed-dimensional branching Brownian motion.Electronic Com- munications in Probability, 20:1–12, 2015

    work page 2015

  34. [34]

    Asymptotic of the maximal displacement in a branching random walk.Graduate J

    Bastien Mallein. Asymptotic of the maximal displacement in a branching random walk.Graduate J. Math, 1(2):92–104, 2016

    work page 2016

  35. [35]

    Large deviations for local mass of branching brownian motion.ALEA, Lat

    Mehmet Öz. Large deviations for local mass of branching brownian motion.ALEA, Lat. Am. J. Probab. Math. Stat., 17:711–731, 2020

    work page 2020

  36. [36]

    On the density of branching Brownian motion.Hacettepe Journal of Mathematics & Statistics, 52(1):229–247, 2023

    Mehmet Öz. On the density of branching Brownian motion.Hacettepe Journal of Mathematics & Statistics, 52(1):229–247, 2023

    work page 2023

  37. [37]

    On the probabilities of large deviations for sums of independent random variables

    Valentin Vladimirovich Petrov. On the probabilities of large deviations for sums of independent random variables. Theory of Probability & Its Applications, 10(2):287–298, 1965

    work page 1965

  38. [38]

    Princeton University Press, 1970

    R Tyrrell Rockafellar.Convex Analysis, volume 18. Princeton University Press, 1970

    work page 1970

  39. [39]

    Sharp large time behaviour in N- dimensional Fisher-KPP equations.Discrete and Continuous Dynamical Systems A, 39:7265–7290, 2019

    Jean-Michel Roquejoffre, Luca Rossi, and Violaine Roussier-Michon. Sharp large time behaviour in N- dimensional Fisher-KPP equations.Discrete and Continuous Dynamical Systems A, 39:7265–7290, 2019

    work page 2019

  40. [40]

    Branching Random Walks

    Zhan Shi. Branching Random Walks. Volume 2151 of Lecture Notes in Mathematics. Springer, 2015

    work page 2015

  41. [41]

    Upper and Lower Bounds for Stochastic Processes: Decomposition Theorems, volume 60

    Michel Talagrand. Upper and Lower Bounds for Stochastic Processes: Decomposition Theorems, volume 60. Springer Nature, 2022. 40

    work page 2022

  42. [42]

    Spatial growth of a branching process of particles living inRd

    Kohei Uchiyama. Spatial growth of a branching process of particles living inRd. The Annals of Probability, 10(4):896–918, 1982

    work page 1982

  43. [43]

    Branching random walks and Gaussian fields.Probability and Statistical Physics in St

    Ofer Zeitouni. Branching random walks and Gaussian fields.Probability and Statistical Physics in St. Peters- burg, 91:437–471, 2016

    work page 2016

  44. [44]

    Lower deviation probabilities for level sets of the branching random walk

    Shuxiong Zhang. Lower deviation probabilities for level sets of the branching random walk. Journal of Theoretical Probability, 36(2):811–844, 2023

    work page 2023

  45. [45]

    Large deviation probabilities for the range of ad-dimensional supercritical branching random walk

    Shuxiong Zhang. Large deviation probabilities for the range of ad-dimensional supercritical branching random walk. Applied Mathematics and Computation, 462:128344, 2024

    work page 2024

  46. [46]

    Modeling shortest paths in polymeric networks using spatial branching processes

    Zhenyuan Zhang, Shaswat Mohanty, Jose Blanchet, and Wei Cai. Modeling shortest paths in polymeric networks using spatial branching processes. Journal of the Mechanics and Physics of Solids, page 105636, 2024. A Index of frequently used notation Deterministic quantities d Underlying dimension of the BRW,d ⩾ 1 {pj}j⩾0 Reproduction law of the BRW ξ Jump dist...

    work page 2024

  47. [47]

    This proves Lemma 22

    + P(Ec 3 | E1 ∩ E2) ⩽ O(e−δ2 √n). This proves Lemma 22. C Some upper bounds of (conditional) ballot probabilities C.1 A multi-dimensional ballot upper bound The results in this appendix are essential for establishing Lemma 13 through Lemma 14. Following the seminal work of [15] on random walks in cones, we prove a multi-dimensional ballot upper bound wher...

    work page