Related papers: Bootstrap percolation on spatial networks
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…
The percolation phase transition in complex network systems attracts much attention and has numerous applications in various research fields. Finite size effects smooth the transition and make it difficult to predict the critical point of…
Every realistic instance of a percolation problem is faced with some degree of polydispersity, e.g., the pore-size distribution of an inhomogeneous medium, the size distribution of filler particles in composite materials, or the vertex…
Understanding the resilience of infrastructures such as transportation network has significant importance for our daily life. Recently, a homogeneous spatial network model was developed for studying spatial embedded networks with…
We investigate percolation transitions in a nonlocal network model numerically. In this model, each node has an exclusive partner and a link is forbidden between two nodes whose $r$-neighbors share any exclusive pair. The $r$-neighbor of a…
The nature of phase boundaries in the QCD phase diagram has not been satisfactorily explored by experiments. Based on the Ginzburg-Landau free energy with a spatially inhomogeneous term as a function of a scalar order parameter, it is…
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$…
We study the $m=3$ bootstrap percolation model on a cubic lattice, using Monte Carlo simulation and finite-size scaling techniques. In bootstrap percolation, sites on a lattice are considered occupied (present) or vacant (absent) with…
We generalize the random graph evolution process of Bohman, Frieze, and Wormald [T. Bohman, A. Frieze, and N. C. Wormald, Random Struct. Algorithms, 25, 432 (2004)]. Potential edges, sampled uniformly at random from the complete graph, are…
Critical phenomena can show unusual phase diagrams when defined in complex network topologies. The case of classical phase transitions such as the classical Ising model and the percolation transition has been studied extensively in the last…
In the polluted modified bootstrap percolation model, sites in the square lattice are independently initially occupied with probability $p$ or closed with probability $q$. A site becomes occupied at a subsequent step if it is not closed and…
We investigate the critical behavior of continuous phase transitions in the context of Ginzburg Landau models with a double well effective potential. In particular, we show that the recently proposed configurational entropy, a measure of…
In the $R$-spread out, $d$-dimensional voter model, each site $x$ of $\mathbb{Z}^d$ has state (or 'opinion') 0 or 1 and, with rate 1, updates its opinion by copying that of some site $y$ chosen uniformly at random among all sites within…
Recently much attention has been paid to the study of the robustness of interdependent and multiplex networks and, in particular, networks of networks. The robustness of interdependent networks can be evaluated by the size of a mutually…
Many realistic systems such as infrastructures are characterized by spatial structure and anisotropic alignment. Here we propose and study a model for dealing with such characteristics by introducing a parameter that controls the strength…
$k$-Core percolation has served as a paradigmatic model of discontinuous percolation for a long time. Recently it was revealed that the order parameter of $k$-core percolation of random networks additionally exhibits critical behavior. Thus…
Random graphs have played an instrumental role in modelling real-world networks arising from the internet topology, social networks, or even protein-interaction networks within cells. Percolation, on the other hand, has been the fundamental…
We study through Monte Carlo simulations and finite-size scaling analysis the nonequilibrium phase transitions of the majority-vote model taking place on spatially embedded networks. These structures are built from an underlying regular…
We study a spatial network model with exponentially distributed link-lengths on an underlying grid of points, undergoing a structural crossover from a random, Erd\H{o}s--R\'enyi graph to a $2D$ lattice at the characteristic interaction…
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…