Phase transition in the diffusion and bootstrap percolation models on regular random and Erdős-Rényi networks

Abstract

The diffusion and bootstrap percolation models were studied in regular random and Erdős-Rényi 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\ge 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.

11 pages, 6 figures

References in corpus (6)

• Recent advances in percolation theory and its applications
• Recent advances and open challenges in percolation
• How does public opinion become extreme?
• Diverse types of percolation transitions
• Newman-Ziff algorithm for the bootstrap percolation: application to the Archimedean lattices
• Reference to Global State and Social Contagion Dynamics