zbMATH — the first resource for mathematics

Random spatial growth with paralyzing obstacles. (English) Zbl 1181.60151
The authors consider following model of spatial growth processes where initially there are sources of growth indicated by the colour green and sources of a growth-stopping (paralyzing) substance indicated by red. Let \(G\) be a connected, countably infinite graph of bounded degree. Each vertex of graph \(G\) is initially, independently of the other vertices, white (vacant), red or green with probabilities \(p_w, p_r\) and \(p_g\) respectively. Each edge of \(G\) is initially closed. It is proved that if the initial density of red vertices is positive, and that of white vertices is sufficiently small, the model is indeed well defined and the distribution has an exponential tail.

60K35 Interacting random processes; statistical mechanics type models; percolation theory
60K37 Processes in random environments
82B43 Percolation
Full Text: DOI EuDML arXiv
[1] D. J. Aldous. The percolation process on a tree where infinite clusters are frozen. Proc. Camb. Phil. Soc. 128 (2000) 465-477. · Zbl 0961.60096 · doi:10.1017/S0305004199004326
[2] K. S. Alexander. Percolation and minimal spanning forests in infinite graphs. Ann. Probab. 23 (1995) 87-104. · Zbl 0827.60079 · doi:10.1214/aop/1176988378
[3] I. Benjamini and O. Schramm. Private communication, 1999.
[4] J. van den Berg and B. Tóth. A signal-recovery system: asymptotic properties, and construction of an infinite-volume process. Stochastic Process. Appl. 96 (2001) 177-190. · Zbl 1058.60093 · doi:10.1016/S0304-4149(01)00113-2
[5] J. van den Berg, A. Járai and B. Vágvölgyi. The size of a pond in 2 D invasion percolation. Electron. Comm. Probab. 12 (2007) 411-420. · Zbl 1128.60087 · eudml:128294
[6] J. T. Chayes, L. Chayes and C. M. Newman. Bernoulli percolation above threshold: an invasion percolation analysis. Ann. Probab. 15 (1987) 1272-1287. · Zbl 0627.60099 · doi:10.1214/aop/1176991976
[7] M. Dürre. Existence of multi-dimensional infinite volume self-organized critical forest-fire models. Electron J. Probab. 11 n. 21, (2006) 513-539 (electronic). · Zbl 1109.60081 · eudml:127184
[8] G. R. Grimmett. Percolation , 2nd edition. Springer, 1999. · Zbl 0926.60004
[9] O. Häggström and R. Meester. Nearest neighbor and hard sphere models in continuum percolation. Random Structures Algorithms 9 (1996) 295-315. · Zbl 0866.60088 · doi:10.1002/(SICI)1098-2418(199610)9:3<295::AID-RSA3>3.0.CO;2-S
[10] O. Häggström, Y. Peres and R. H. Schonmann. Percolation on transitive graphs as a coalescent process: relentless merging followed by simultaneous uniqueness. In Perplexing Problems in Probability (M. Bramson and R. Durrett, Eds) 44 69-90. Birkhäuser, Boston, 1999. · Zbl 0948.60098
[11] A. Járai. Private communication, 1999.
[12] A. Járai. Invasion percolation and the incipient infinite cluster in 2D. Comm. Math. Phys. 236 (2003) 311-334. · Zbl 1041.82020 · doi:10.1007/s00220-003-0796-6
[13] H. Kesten. Analyticity properties and power law estimates in percolation theory. J. Statist. Phys. 25 (1981) 717-756. · Zbl 0512.60095 · doi:10.1007/BF01022364
[14] H. Kesten. Scaling relations for 2D percolation. Comm. Math. Phys. 109 (1987) 109-156. · Zbl 0616.60099 · doi:10.1007/BF01205674
[15] R. Lyons, Y. Peres. Probability on trees and networks. Available at http://mypage.iu.edu/ rdlyons/.
[16] R. Lyons, Y. Peres and O. Schramm. Minimal spanning forests. Ann. Probab. 34 (2006) 1665-1692. · Zbl 1142.60065 · doi:10.1214/009117906000000269 · euclid:aop/1163517218
[17] D. L. Stein and C. M. Newman. Broken ergodicity and the geometry of rugged landscapes. Phys. Rev. E 51 (1995) 5228-5238.
[18] D. Wilkinson and J. F. Willemsen. Invasion percolation: a new form of percolation theory. J. Phys. A 16 (1983) 3365-3376. · doi:10.1088/0305-4470/16/14/028
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.