Phase transition in the diffusion and bootstrap percolation models on regular random and Erdos-R\'enyi networks
Abstract
The diffusion and bootstrap percolation models were studied in regular random and Erdos-R\'enyi networks using the modified Newman-Ziff algorithms. We calculated the percolation threshold and the order parameter of the percolation transition (strength of the giant cluster) and its derivatives. The percolation transitions are classified by the results. The diffusion percolation with a small k has a double transition, and the bootstrap percolation with m≥3 has the first-order percolation transition. The diffusion percolation with a large k and the bootstrap percolation with a small m show the second-order percolation transition. Particularly, third-order percolation transitions were discovered in the bootstrap percolation of m=2 in regular random networks.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.