Related papers: Continuous percolation phase transitions of random…
A model of correlated random networks is examined, i.e. networks with correlations between the degrees of neighboring nodes. These nodes do not necessarily have to be direct neighbors, the maximum range of the correlations can be…
We study a model that generalizes the CP with diffusion. An additional transition is included in the model so that at a particular point of its phase diagram a crossover from the directed percolation to the compact directed percolation…
We investigate the following vertex percolation process. Starting with a random regular graph of constant degree, delete each vertex independently with probability p, where p=n^{-alpha} and alpha=alpha(n) is bounded away from 0. We show…
We propose a statistical model defined on the three-dimensional diamond network where the splitting of randomly selected nodes leads to a spatially disordered network, with decreasing degree of connectivity. The terminal state, that is…
We present an exact solution of percolation in a generalized class of Watts-Strogatz graphs defined on a 1-dimensional underlying lattice. We find a non-classical critical point in the limit of the number of long-range bonds in the system…
Percolation theory is an approach to study vulnerability of a system. We develop analytical framework and analyze percolation properties of a network composed of interdependent networks (NetONet). Typically, percolation of a single network…
We numerically study bootstrap percolation on Kleinberg's spatial networks, in which the probability density function of a node to have a long-range link at distance $r$ scales as $P(r)\sim r^{\alpha}$. Setting the ratio of the size of the…
Clusters generated by the product-rule growth model of Achlioptas, D'Souza, and Spencer on a two-dimensional square lattice are shown to obey qualitatively different scaling behavior than standard (random growth) percolation. The threshold…
Despite original claims of a first-order transition in the product rule model proposed by Achlioptas et al. [Science 323, 1453 (2009)], recent studies indicate that this percolation model, in fact, displays a continuous transition. The…
The theme of this paper is the analysis of bootstrap percolation processes on random graphs generated by preferential attachment. This is a class of infection processes where vertices have two states: they are either infected or…
Consider a uniformly random regular graph of a fixed degree $d\ge3$, with $n$ vertices. Suppose that each edge is open (closed), with probability $p(q=1-p)$, respectively. In 2004 Alon, Benjamini and Stacey proved that $p^*=(d-1)^{-1}$ is…
We analyze a minimal model of a growing network. At each time step, a new vertex is added; then, with probability delta, two vertices are chosen uniformly at random and joined by an undirected edge. This process is repeated for t time…
We investigate the component sizes of the critical configuration model, as well as the related problem of critical percolation on a supercritical configuration model. We show that, at criticality, the finite third moment assumption on the…
A wide variety of complex networks (social, biological, information etc.) exhibit local clustering with substantial variation in the clustering coefficient (the probability of neighbors being connected). Existing models of large graphs…
We study the Ising model in a hierarchical small-world network by renormalization group analysis, and find a phase transition between an ordered phase and a critical phase, which is driven by the coupling strength of the shortcut edges.…
There is growing evidence that electronic and molecular networks present some common universal properties, among which the existence of a self-organized intermediate phase. In glasses, the latter is revealed by the reversibility window…
During the past two decades, percolation has long served as a basic paradigm for network resilience, community formation and so on in complex systems. While the percolation transition is known as one of the most robust continuous…
We consider the Erd\"{o}s--R\'{e}nyi random graph $G_{n,p}$ and we analyze the simple irreversible epidemic process on the graph, known in the literature as bootstrap percolation. We give a quantitative version of some results by Janson et…
Distributions of the size of the largest component, in particular the large-deviation tail, are studied numerically for two graph ensembles, for Erdoes-Renyi random graphs with finite connectivity and for two-dimensional bond percolation.…
We study a coevolution voter model on a network that evolves according to the state of the nodes. In a single update, a link between opposite-state nodes is rewired with probability $p$, while with probability $1-p$ one of the nodes takes…