Abstract
We study the branching random walk on weighted graphs; site-breeding and edge-breeding branching random walks on graphs are seen as particular cases. Two kinds of survival can be identified: a weak survival (with positive probability there is at least one particle alive somewhere at any time) and a strong survival (with positive probability the colony survives by returning infinitely often to a fixed site). The behavior of the process depends on the value of a certain parameter which controls the birth rates; the threshold between survival and (almost sure) extinction is called critical value. We describe the strong critical value in terms of a geometrical parameter of the graph. We characterize the weak critical value and relate it to another geometrical parameter. We prove that, at the strong critical value, the process dies out locally almost surely; while, at the weak critical value, global survival and global extinction are both possible.
Similar content being viewed by others
References
Bertacchi, D., Zucca, F.: Critical behaviors and critical values of branching random walks on multigraphs. J. Appl. Probab. 45, 481–497 (2008)
Förster, K.H., Nagy, B.: On the Collatz-Wielandt numbers and the local spectral radius of a nonnegative operator. In: Proceedings of the Fourth Haifa Matrix Theory Conference, Haifa, 1988. Linear Algebra Appl., vol. 120, pp. 193–205 (1989)
Förster, K.H., Nagy, B.: Local spectral radii and Collatz-Wielandt numbers of monic operator polynomials with nonnegative coefficients. Linear Algebra Appl. 268, 41–57 (1998)
Hueter, I., Lalley, S.P.: Anisotropic branching random walks on homogeneous trees. Probab. Theory Relat. Fields 116(1), 57–88 (2000)
Liggett, T.M.: Branching random walks and contact processes on homogeneous trees. Probab. Theory Relat. Fields 106(4), 495–519 (1996)
Liggett, T.M.: Branching random walks on finite trees. In: Perplexing Problems in Probability. Progr. Probab., vol. 44, pp. 315–330. Birkhäuser, Boston (1999)
Madras, N., Schinazi, R.: Branching random walks on trees. Stoch. Proc. Appl. 42(2), 255–267 (1992)
Marek, I.: Collatz-Wielandt numbers in general partially ordered spaces. Linear Algebra Appl. 173, 165–180 (1992)
Pemantle, R.: The contact process on trees. Ann. Probab. 20, 2089–2116 (1992)
Pemantle, R., Stacey, A.M.: The branching random walk and contact process on Galton–Watson and nonhomogeneous trees. Ann. Probab. 29(4), 1563–1590 (2001)
Stacey, A.M.: Branching random walks on quasi-transitive graphs. Comb. Probab. Comput. 12(3), 345–358 (2003)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bertacchi, D., Zucca, F. Characterization of Critical Values of Branching Random Walks on Weighted Graphs through Infinite-Type Branching Processes. J Stat Phys 134, 53–65 (2009). https://doi.org/10.1007/s10955-008-9653-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10955-008-9653-5