We study a finite-horizon first-arrival competition generated by two independent branching random walks on regular tree exhaustions and sparse Erdős–Rényi graphs. The paper focuses on a variance-sensitive mechanism that is invisible at the level of first moments. If two offspring laws have the same mean but different second factorial moments $ \eta = \mathbb E[K(K-1)] $, then their many-to-one occupation fields agree, while their second moments and the genealogies selected by size-biased sampling can differ. We make this distinction explicit through a size-biased spine calculation: Under the associated size-biased measure, the expected number of non-spine sibling subtrees per spine generation is $ \eta/m $. For any target set fixed before the branching realization, we further derive an exact finite-time $ \eta $-response theorem: Changing $ \eta $ by $ \Delta\eta $ changes the target second moment by $ \Delta\eta\, \Gamma_T(A) $, where $ \Gamma_T(A) $ is an explicit nonnegative random-walk kernel, and changes the terminal-size-weighted survivor target occupation by $ (\Delta\eta/m)P^T(a, A)\sum_{\ell = 0}^{T-1}m^\ell $. These identities quantify both intermittency and size-biased enrichment without identifying the spine law with ordinary survival conditioning. A finite-time Paley–Zygmund bound records how unconditional hitting, second moments, and survival probabilities interact. The computational protocol is designed accordingly. The Erdős–Rényi experiment is annealed over independent graph instances, red and blue start from an exchangeable pair of neighbours of a high-degree root, and graph-level cluster bootstrap and paired graph-level comparisons are used for sparse-graph summaries. The numerical results are reported as finite-size diagnostics, not as an infinite-volume coexistence theorem. They support the following picture: Fixed-mean high variance is not uniformly advantageous, but after survival filtering its surviving genealogies can have a larger observed contribution near the outer frontier.
Citation: Yunzhi Zhu, Saisai Hou, Sen Zhang. Finite-horizon competition of branching random walks on trees and sparse random graphs: Size-biased genealogy and annealed simulation diagnostics[J]. AIMS Mathematics, 2026, 11(9): 29907-29933. doi: 10.3934/math.20261187
We study a finite-horizon first-arrival competition generated by two independent branching random walks on regular tree exhaustions and sparse Erdős–Rényi graphs. The paper focuses on a variance-sensitive mechanism that is invisible at the level of first moments. If two offspring laws have the same mean but different second factorial moments $ \eta = \mathbb E[K(K-1)] $, then their many-to-one occupation fields agree, while their second moments and the genealogies selected by size-biased sampling can differ. We make this distinction explicit through a size-biased spine calculation: Under the associated size-biased measure, the expected number of non-spine sibling subtrees per spine generation is $ \eta/m $. For any target set fixed before the branching realization, we further derive an exact finite-time $ \eta $-response theorem: Changing $ \eta $ by $ \Delta\eta $ changes the target second moment by $ \Delta\eta\, \Gamma_T(A) $, where $ \Gamma_T(A) $ is an explicit nonnegative random-walk kernel, and changes the terminal-size-weighted survivor target occupation by $ (\Delta\eta/m)P^T(a, A)\sum_{\ell = 0}^{T-1}m^\ell $. These identities quantify both intermittency and size-biased enrichment without identifying the spine law with ordinary survival conditioning. A finite-time Paley–Zygmund bound records how unconditional hitting, second moments, and survival probabilities interact. The computational protocol is designed accordingly. The Erdős–Rényi experiment is annealed over independent graph instances, red and blue start from an exchangeable pair of neighbours of a high-degree root, and graph-level cluster bootstrap and paired graph-level comparisons are used for sparse-graph summaries. The numerical results are reported as finite-size diagnostics, not as an infinite-volume coexistence theorem. They support the following picture: Fixed-mean high variance is not uniformly advantageous, but after survival filtering its surviving genealogies can have a larger observed contribution near the outer frontier.
| [1] |
J. D. Biggins, The first- and last-birth problems for a multitype age-dependent branching process, Adv. Appl. Probab., 8 (1976), 446–459. https://doi.org/10.2307/1426138 doi: 10.2307/1426138
|
| [2] |
J. M. Hammersley, Postulates for subadditive processes, Ann. Probab., 2 (1974), 652–680. https://doi.org/10.1214/aop/1176996611 doi: 10.1214/aop/1176996611
|
| [3] |
J. F. C. Kingman, The first birth problem for an age-dependent branching process, Ann. Probab., 3 (1975), 790–801. https://doi.org/10.1214/aop/1176996266 doi: 10.1214/aop/1176996266
|
| [4] |
L. Addario-Berry, B. Reed, Minima in branching random walks, Ann. Probab., 37 (2009), 1044–1079. https://doi.org/10.1214/08-AOP428 doi: 10.1214/08-AOP428
|
| [5] |
Y. Hu, Z. Shi, Minimal position and critical martingale convergence in branching random walks, and directed polymers on disordered trees, Ann. Probab., 37 (2009), 742–789. https://doi.org/10.1214/08-AOP419 doi: 10.1214/08-AOP419
|
| [6] |
E. Aïdékon, Convergence in law of the minimum of a branching random walk, Ann. Probab., 41 (2013), 1362–1426. https://doi.org/10.1214/12-AOP750 doi: 10.1214/12-AOP750
|
| [7] |
T. Madaule, Convergence in law for the branching random walk seen from its tip, J. Theor. Probab., 30 (2017), 27–63. https://doi.org/10.1007/s10959-015-0636-6 doi: 10.1007/s10959-015-0636-6
|
| [8] |
N. Gantert, T. Höfelsauer, Large deviations for the maximum of a branching random walk, Electron. Commun. Probab., 23 (2018), 1–12. https://doi.org/10.1214/18-ECP135 doi: 10.1214/18-ECP135
|
| [9] |
P. Dyszewski, N. Gantert, T. Höfelsauer, The maximum of a branching random walk with stretched exponential tails, Ann. Inst. H. Poincaré Probab. Statist., 59 (2023), 539–562. https://doi.org/10.1214/22-AIHP1260 doi: 10.1214/22-AIHP1260
|
| [10] | R. Lyons, Y. Peres, Probability on trees and networks, Cambridge: Cambridge University Press, 2017. https://doi.org/10.1017/9781316672815 |
| [11] |
J. D. Biggins, A. E. Kyprianou, Measure change in multitype branching, Adv. Appl. Probab., 36 (2004), 544–581. https://doi.org/10.1239/aap/1086957585 doi: 10.1239/aap/1086957585
|
| [12] | Z. Shi, Branching random walks: École d'Été de probabilités de saint-flour XLII–2012, Cham: Springer, 2015. https://doi.org/10.1007/978-3-319-25372-5 |
| [13] | M. Deijfen, O. Häggström, The pleasures and pains of studying the two-type Richardson model, In: Analysis and stochastics of growth processes and interface models, Oxford: Oxford University Press, 2008, 39–54. https://doi.org/10.1093/acprof: oso/9780199239252.003.0002 |
| [14] |
M. Deijfen, T. Vilkas, Competition on $\mathbb Z^d$ driven by branching random walk, Electron. Commun. Probab., 28 (2023), 1–11. https://doi.org/10.1214/23-ECP521 doi: 10.1214/23-ECP521
|
| [15] |
D. Bertacchi, F. Zucca, A generating function approach to branching random walks, Braz. J. Probab. Stat., 31 (2017), 229–253. https://doi.org/10.1214/16-BJPS311 doi: 10.1214/16-BJPS311
|
| [16] |
D. Bertacchi, F. Zucca, Strong survival and extinction for branching random walks via new order for generating functions, J. Appl. Probab., 63 (2026), 950–968. https://doi.org/10.1017/jpr.2025.10070 doi: 10.1017/jpr.2025.10070
|
| [17] |
M. Dussaule, L. Wang, W. Yang, Branching random walks on relatively hyperbolic groups, Ann. Probab., 53 (2025), 391–452. https://doi.org/10.1214/24-AOP1708 doi: 10.1214/24-AOP1708
|
| [18] |
I. Makarova, D. Balashova, S. Molchanov, E. Yarovaya, Branching random walks with two types of particles on multidimensional lattices, Mathematics, 10 (2022), 867. https://doi.org/10.3390/math10060867 doi: 10.3390/math10060867
|
| [19] |
F. Coghi, J. Morand, H. Touchette, Large deviations of random walks on random graphs, Phys. Rev. E, 99 (2019), 022137. https://doi.org/10.1103/PhysRevE.99.022137 doi: 10.1103/PhysRevE.99.022137
|
| [20] | B. Bollobás, Random graphs, 2 Eds., Cambridge: Cambridge University Press, 2011. https://doi.org/10.1017/CBO9780511814068 |
| [21] | R. van der Hofstad, Random graphs and complex networks, Cambridge: Cambridge University Press, 2017. https://doi.org/10.1017/9781316779422 |
| [22] | M. Newman, Networks, 2 Eds., Oxford: Oxford University Press, 2018. https://doi.org/10.1093/oso/9780198805090.001.0001 |