Related papers: Mean field frozen percolation
Mean-field frozen percolation is a random graph-valued process, which adjusts the dynamics of the classical Erdos-Renyi process with an additional mechanism to 'freeze' potential giant components before they can form. It is known to exhibit…
We propose an approach to calculate the critical percolation threshold for finite-sized Erdos-Renyi digraphs using minimal Hamiltonian cycles. We obtain an analytically exact result, valid non-asymptotically for all graph sizes, which…
In this paper we define a directed percolation over Erdos-Renyi graphs and derive weak limit results for the resulting stochastic process.
We study perturbations of the Erdos-Renyi model for which the statistical weight of a graph depends on the abundance of certain geometrical patterns. Using the formal correspondance with an exactly solvable effective model, we show the…
Understanding how network structure constrains and enables information processing is a central problem in the statistical mechanics of interacting systems. Here we study random networks across the structural percolation transition and…
We study the spectrum of adjacency matrices of random graphs. We develop two techniques to lower bound the mass of the continuous part of the spectral measure or the density of states. As an application, we prove that the spectral measure…
We apply a PDE-based method to deduce the critical time and the size of the giant component of the ``triangle percolation'' on the Erd\H{o}s-R\'enyi random graph process investigated by Palla, Der\'enyi and Vicsek
We study the evolution of percolation with freezing. Specifically, we consider cluster formation via two competing processes: irreversible aggregation and freezing. We find that when the freezing rate exceeds a certain threshold, the…
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 consider vertex percolation on pseudo-random $d-$regular graphs. The previous study by the second author established the existence of phase transition from small components to a linear (in $\frac{n}{d}$) sized component, at…
The directed bond percolation process is studied in the presence of com- pressible velocity fluctuations with long-range correlations. We discuss a construction of a field theoretic action and a way of obtaining its large scale properties…
We introduce models of generic rigidity percolation in two dimensions on hierarchical networks, and solve them exactly by means of a renormalization transformation. We then study how the possibility for the network to self organize in order…
We present a detailed study of the evolution of the number of connected components in sub-critical multiplicative random graph processes. We consider a model where edges appear independently after an exponential time at rate equal to the…
We study the asymptotic behaviour of Markov processes on large weighted Erdos-Renyi graphs where the transition rates of the vertices are only influenced by the state of their neighbours and the corresponding weight on the edges. We find…
We study phase transitions in the Ising model on random graphs using graph limits. We show that the critical temperatures are determined by the eigenvalues of the kernel operator associated with the graph limit. Bifurcation diagrams for…
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 consider site (vertex) percolation on $d$-regular graphs, for both constant-degree and growing-degree cases. We give sufficient, and relatively tight, conditions for the emergence of the ``Erd\H{o}s-R\'enyi component phenomenon" in the…
We study the mean time for a random walk to traverse between two arbitrary sites of the Erdos-Renyi random graph. We develop an effective medium approximation that predicts that the mean first-passage time between pairs of nodes, as well as…
Frozen percolation on the binary tree was introduced by Aldous around fifteen years ago, inspired by sol-gel transitions. We investigate a version of the model on the triangular lattice, where connected components stop growing ("freeze") as…
A scaling limit for the simple random walk on the largest connected component of the Erdos-Renyi random graph in the critical window is deduced. The limiting diffusion is constructed using resistance form techniques, and is shown to satisfy…