English
Related papers

Related papers: The large connectivity limit of bootstrap percolat…

200 papers

We study the onset of the bootstrap percolation transition as a model of generalized dynamical arrest. We develop a new importance-sampling procedure in simulation, based on rare events around "holes", that enables us to access bootstrap…

Statistical Mechanics · Physics 2009-11-10 Paolo De Gregorio , Aonghus Lawlor , Phil Bradley , Kenneth A. Dawson

The emergence of large-scale connectivity and synchronization are crucial to the structure, function and failure of many complex socio-technical networks. Thus, there is great interest in analyzing phase transitions to large-scale…

Physics and Society · Physics 2019-10-02 Raissa M. D'Souza , Jesus Gómez-Gardeñes , Jan Nagler , Alex Arenas

Consider growing a network, in which every new connection is made between two disconnected nodes. At least one node is chosen randomly from a subset consisting of $g$ fraction of the entire population in the smallest clusters. Here we show…

Statistical Mechanics · Physics 2016-01-20 Y. S. Cho , J. S. Lee , H. J. Herrmann , B. Kahng

We consider robustness and percolation properties of the networks of networks, in which random nodes in different individual networks (layers) can be interdependent. We explore the emergence of the giant mutually connected component,…

Disordered Systems and Neural Networks · Physics 2014-11-18 Ginestra Bianconi , Sergey N. Dorogovtsev

Bootstrap percolation is a process that is used to model the spread of an infection on a given graph. In the model considered here each vertex is equipped with an individual threshold. As soon as the number of infected neighbors exceeds…

Probability · Mathematics 2022-10-25 Nils Detering , Thilo Meyer-Brandis , Konstantinos Panagiotou

Bootstrap percolation is an often used model to study the spread of diseases, rumors, and information on sparse random graphs. The percolation process demonstrates a critical value such that the graph is either almost completely affected or…

Probability · Mathematics 2015-12-07 Peter Ballen , Sudipto Guha

Bootstrap percolation in (random) graphs is a contagion dynamics among a set of vertices with certain threshold levels. The process is started by a set of initially infected vertices, and an initially uninfected vertex with threshold $k$…

Probability · Mathematics 2022-11-03 Nils Detering , Jimin Lin

It has been recently established that heterogeneous bootstrap percolation and related dynamic facilitation models exhibit a complex hierarchy of continuous and discontinuous transitions depending on lattice connectivity and kinetic…

Statistical Mechanics · Physics 2015-06-12 Mauro Sellitto

Giant atoms, which couple to the environment at multiple discrete points, exhibit various nontrivial phenomena in quantum optics due to their nonlocal couplings. In this study, we propose a one-dimensional cross-stitch ladder lattice…

Quantum Physics · Physics 2025-12-19 Ying Xia , Jia-Qi Li , Xin Wang

The square lattice with central forces between nearest neighbors is isostatic with a subextensive number of floppy modes. It can be made rigid by the random addition of next-nearest neighbor bonds. This constitutes a rigidity percolation…

Statistical Mechanics · Physics 2011-12-06 Wouter G. Ellenbroek , Xiaoming Mao

The regular tree corresponds to the random regular graph as its local limit. For this reason the famous double phase transition of the contact process on regular tree has been seen to correspond to a phase transition on the large random…

Probability · Mathematics 2025-03-14 John Fernley

We study the effects of mobility on two crucial characteristics in multi-scale dynamic networks: percolation and connection times. Our analysis provides insights into the question, to what extent long-time averages are well-approximated by…

Probability · Mathematics 2021-03-05 Christian Hirsch , Benedikt Jahnel , Elie Cali

Explosive percolation in a network is a phase transition where a large portion of nodes becomes connected with an addition of a small number of edges. Although extensively studied in random network models and reconstructed real networks,…

Physics and Society · Physics 2016-02-10 Satoru Hayasaka

A hybrid phase transition (HPT) that exhibits properties of continuous and discontinuous phase transitions at the same transition point has been observed in diverse complex systems. Previous studies of the HPTs on complex networks mainly…

Statistical Mechanics · Physics 2017-02-15 Wonjun Choi , Deokjae Lee , B. Kahng

We study atypical behavior in bootstrap percolation on the Erd\H{o}s-R\'enyi random graph. Initially a set $S$ is infected. Other vertices are infected once at least $r$ of their neighbors become infected. Janson et al. (2012) locates the…

Probability · Mathematics 2025-11-18 Omer Angel , Brett Kolesnik

The phase ordering dynamics of coupled chaotic maps on fractal networks are investigated. The statistical properties of the systems are characterized by means of the persistence probability of equivalent spin variables that define the…

Chaotic Dynamics · Physics 2007-05-23 K. Tucci , M. G. Cosenza , O. Alvarez-Llamoza

Bootstrap percolation is a type of cellular automaton on graphs, introduced as a simple model of the dynamics of ferromagnetism. Vertices in a graph can be in one of two states: `healthy' or `infected' and from an initial configuration of…

Probability · Mathematics 2015-06-01 Tom Coker , Karen Gunderson

In this Letter, we show that the explosive percolation is a novel continuous phase transition. The order-parameter-distribution histogram at the percolation threshold is studied in Erd\H{o}s-R\'{e}nyi networks, scale-free networks, and…

Disordered Systems and Neural Networks · Physics 2012-02-22 Liang Tian , Da-Ning Shi

Percolation transition (PT) means the formation of a macroscopic-scale large cluster, which exhibits a continuous transition. However, when the growth of large clusters is globally suppressed, the type of PT is changed to a discontinuous…

Statistical Mechanics · Physics 2021-05-24 K. Choi , Wonjun Choi , B. Kahng

In this paper we study the strict majority bootstrap percolation process on graphs. Vertices may be active or passive. Initially, active vertices are chosen independently with probability p. Each passive vertex becomes active if at least…

Social and Information Networks · Computer Science 2013-11-21 Marcos Kiwi , Pablo Moisset de Espanés , Ivan Rapaport , Sergio Rica , Guillaume Theyssier