Related papers: Exact Site and Bond Percolation Probability on Lat…
Does there exist a Lipschitz injection of $\mathbb{Z}^d$ into the open set of a site percolation process on $\mathbb{Z}^D$, if the percolation parameter p is sufficiently close to 1? We prove a negative answer when d=D and also when…
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 consider site percolation of dimers (``neadles'') on simple cubic lattice. The percolation threshold is estimated as $p_c^\text{perc} \approx 0.2555 \pm 0.0001$. The jamming threshold is estimated as $p_c^\text{jamm} = 0.799 \pm 0.002$.
A useful result about leftmost and rightmost paths in two dimensional bond percolation is proved. This result was introduced without proof in \cite{G} in the context of the contact process in continuous time. As discussed here, it also…
We study a random graph model which is a superposition of the bond percolation model on $Z^d$ with probability $p$ of an edge, and a classical random graph $G(n, c/n)$. We show that this model, being a {\it homogeneous} random graph, has a…
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…
Percolation is a model for random damage to a network. It is one of the simplest models that displays a phase transition: when the network is severely damaged, it falls apart in many small connected components, while if the damage is light,…
A new position-space renormalization group approach is investigated for bond directed percolation in two dimensions. The threshold value for the bond occupation probabilities is found to be $p_c=0.6443$. Correlation length exponents on time…
The stacked triangular lattice has the shape of a triangular prism. In spite of being considered frequently in solid state physics and materials science, its percolation properties have received few attention. We investigate several…
We present an exact mathematical framework able to describe site-percolation transitions in real multiplex networks. Specifically, we consider the average percolation diagram valid over an infinite number of random configurations where…
We determine the site and bond percolation thresholds for a system of disordered jammed sphere packings in the maximally random jammed state, generated by the Torquato-Jiao algorithm. For the site threshold, which gives the fraction of…
We study the following problem for critical site percolation on the triangular lattice. Let A and B be sites on a horizontal line e separated by distance n. Consider, in the half-plane above e, the lowest occupied crossing R from the…
Consider the problem of determining the maximal induced subgraph in a random $d$-regular graph such that its components remain bounded as the size of the graph becomes arbitrarily large. We show, for asymptotically large $d$, that any such…
We consider first passage percolation with i.i.d. weights on edges of the d-dimensional cubic lattice. Under the assumptions that a weight is equal to zero with probability smaller than the critical probability of bond percolation in the…
We introduce a set of iterative equations that exactly solves the size distribution of components on small arbitrary graphs after the random removal of edges. We also demonstrate how these equations can be used to predict the distribution…
We study site percolation on lattices confined to a semi-infinite strip. For triangular and square lattices we find that the probability that a cluster touches the three sides of such a system at the percolation threshold has the continuous…
We present an analytical approach for bond percolation on multiplex networks and use it to determine the expected size of the giant connected component and the value of the critical bond occupation probability in these networks. We advocate…
Percolation is perhaps the simplest example of a process exhibiting a phase transition and one of the most studied phenomena in statistical physics. The percolation transition is continuous if sites/bonds are occupied independently with the…
Consider a uniform expanders family G_n with a uniform bound on the degrees. It is shown that for any p and c>0, a random subgraph of G_n obtained by retaining each edge, randomly and independently, with probability p, will have at most one…
Recently S.Galam and A.Mauger [Phys.Rev.E 56, 322 (1997); cond-mat/9706304 ] proposed an approximant which relates the bond and the site percolation threshold for a particular lattice. Their formula is based on a fit to exact and simulation…