Line percolation in finite projective planes. (English) Zbl 1430.60083
Summary: We study combinatorial parameters of a recently introduced bootstrap percolation problem in finite projective planes. We present sharp results on the size of the minimum percolating sets and the maximal nonpercolating sets. Additional results on the minimal and maximal percolation time as well as on the critical probability in the projective plane are also presented.
MSC:
| 60K35 | Interacting random processes; statistical mechanics type models; percolation theory |
| 05C35 | Extremal problems in graph theory |
| 60C05 | Combinatorial probability |
References:
| [1] | H. Amini, {\it Bootstrap percolation in living neural networks}, J. Stat. Phys., 141 (2010), pp. 459-475. · Zbl 1207.82037 |
| [2] | P. Balister, B. Bollobás, J. Lee, and B. Narayanan, {\it Line percolation}, Random Structures Algorithms, (2018), . · Zbl 1394.60097 |
| [3] | S. Ball, {\it Finite Geometry and Combinatorial Applications}, Cambridge University Press, Cambridge, UK, 2015. · Zbl 1352.05001 |
| [4] | J. Balogh, B. Bollobás, H. Duminil-Copin, and R. Morris, {\it The sharp threshold for bootstrap percolation in all dimensions}, Trans. Amer. Math. Soc., 364 (2012), pp. 2667-2701. · Zbl 1238.60108 |
| [5] | A. Barlotti, {\it Sui \((k; n)\)-archi di un piano lineare finite}, Boll. Un. Mat. Ital., 11 (1956), pp. 553-556. · Zbl 0072.38103 |
| [6] | F. Benevides and M. Przykucki, {\it Maximum percolation time in two-dimensional bootstrap percolation}, SIAM J. Discrete Math., 29 (2015), pp. 224-251, . · Zbl 1371.60169 |
| [7] | B. Bollobás, M. Przykucki, O. Riordan, and J. Sahasrabudhe, {\it On the maximum running time in graph bootstrap percolation}, Electron. J. Combin., 24 (2017), 2.16. · Zbl 1361.05135 |
| [8] | A. Fey, L. Levine, and Y. Peres, {\it Growth rates and explosions in sandpiles}, J. Stat. Phys., 138 (2010), pp. 143-159. · Zbl 1186.82043 |
| [9] | J. Gravner, C. Hoffman, J. Pfeiffer, and D. Sivakoff, {\it Bootstrap percolation on the Hamming torus}, Ann. Appl. Probab., 25 (2015), pp. 287-323. · Zbl 1308.60109 |
| [10] | K. Gunderson, S. Koch, and M. Przykucki, {\it The time of graph bootstrap percolation}, Random Structures Algorithms, 51 (2017), pp. 143-168. · Zbl 1370.05189 |
| [11] | S. Janson, T. Ł uczak, and A. Ruciński, {\it Random Graphs}, Wiley Ser. Discrete Math. Optim. 45, John Wiley & Sons, New York, 2011. · Zbl 1223.05201 |
| [12] | I. H. Lee and A. Valentinyi, {\it Noisy contagion without mutation}, Rev. Econom. Stud., 67 (2000), pp. 47-56. · Zbl 0956.91026 |
| [13] | R. van der Hofstad, {\it Random Graphs and Complex Networks}, Vol. 1, Camb. Ser. Stat. Probab. Math. 43, Cambridge University Press, Cambridge, UK, 2017. · Zbl 1361.05002 |
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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
