Related papers: A percolation on directed graphs
We study site and bond percolation on directed simple random graphs with a given degree distribution and derive the expressions for the critical value of the percolation probability above which the giant strongly connected component emerges…
We analyze site percolation on directed and undirected graphs with site-dependent open-site probabilities. We construct upper bounds on cluster susceptibilities, vertex connectivity functions, and the expected number of simple open cycles…
We introduce a non-standard model for percolation on the integer lattice $\mathbb Z^2$. Randomly assign to each vertex $a \in \mathbb Z^2$ a potential, denoted $\phi_a$, chosen independently and uniformly from the interval $[0, 1]$. For…
We present a comprehensive and versatile theoretical framework to study site and bond percolation on clustered and correlated random graphs. Our contribution can be summarized in three main points. (i) We introduce a set of iterative…
We consider a class of random, weighted networks, obtained through a redefinition of patterns in an Hopfield-like model and, by performing percolation processes, we get information about topology and resilience properties of the networks…
A question relating the critical probability for percolation, the critical probability for a unique infinite cluster and graph limits is presented, together with some partial results.
The percolation properties of clustered networks are analyzed in detail. In the case of weak clustering, we present an analytical approach that allows to find the critical threshold and the size of the giant component. Numerical simulations…
We study infinite ``$+$'' or ``$-$'' clusters for an Ising model on an connected, transitive, non-amenable, planar, one-ended graph $G$ with finite vertex degree. If the critical percolation probability $p_c^{site}$ for the i.i.d.~Bernoulli…
Any infinite graph has site and bond percolation critical probabilities satisfying $p_c^{site}\geq p_c^{bond}$. The strict version of this inequality holds for many, but not all, infinite graphs. In this paper, the class of graphs for which…
The problem of continuum percolation in dispersions of rods is reformulated in terms of weighted random geometric graphs. Nodes (or sites or vertices) in the graph represent spatial locations occupied by the centers of the rods. The…
The site percolation on the triangular lattice stands out as one of the few exactly solved statistical systems. By initially configuring critical percolation clusters of this model and randomly reassigning the color of each percolation…
The random-cluster model, a correlated bond percolation model, unifies a range of important models of statistical mechanics in one description, including independent bond percolation, the Potts model and uniform spanning trees. By…
We give an example of a long range Bernoulli percolation process on a group non-quasi-isometric with $\mathbb{Z}$, in which clusters are almost surely finite for all values of the parameter. This random graph admits diverse equivalent…
Recent work on the internet, social networks, and the power grid has addressed the resilience of these networks to either random or targeted deletion of network nodes. Such deletions include, for example, the failure of internet routers or…
We study the two most common types of percolation process on a sparse random graph with a given degree sequence. Namely, we examine first a bond percolation process where the edges of the graph are retained with probability p and afterwards…
We develop a cluster expansion for the probability of full connectivity of high density random networks in confined geometries. In contrast to percolation phenomena at lower densities, boundary effects, which have previously been largely…
In dynamical percolation, the status of every bond is refreshed according to an independent Poisson clock. For graphs which do not percolate at criticality, the dynamical sensitivity of this property was analyzed extensively in the last…
We present a scaling hypothesis for the distribution function of the shortest paths connecting any two points on a percolating cluster which accounts for {\it (i)} the effect of the finite size of the system, and {\it (ii)} the dependence…
We study the effects of nonreciprocity and network structure on percolation. To this end, we investigate nonreciprocal random networks - directed networks for which the probability of a link occurring from node i to node j differs from the…
The probability distribution for the number of top to bottom spanning clusters in Directed percolation in two and three dimensions appears to be universal and is of the form $P(n) \sim \exp(-\alpha n^2)$. We argue that $\alpha$ is a new…