Related papers: Upper bounds on the percolation correlation length
By studying its subgraphs, it is argued that the lower critical percolation threshold of the enhanced binary tree (EBT) is bounded as $p_{c1} < 0.355059$, while the upper threshold is bounded both from above and below by 1/2 according to…
We investigate the percolative properties of the vacant set left by random interlacements on Z^d, when d is large. A non-negative parameter u controls the density of random interlacements on Z^d. It is known from arXiv:0704.2560, and…
Despite great progress in the study of critical percolation on $\mathbb{Z}^d$ for $d$ large, properties of critical clusters in high-dimensional fractional spaces and boxes remain poorly understood, unlike the situation in two dimensions.…
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.
We show that for all p>p_c(\Z^d) percolation parameters, the probability that the cluster of the origin is finite but has at least t vertices at distance one from the infinite cluster is exponentially small in t. We use this to give a short…
A new algorithm for the derivation of low-density expansions has been used to greatly extend the series for moments of the pair-connectedness on the directed square lattice near an impenetrable wall. Analysis of the series yields very…
We describe the component sizes in critical independent p-bond percolation on a random d-regular graph on n vertices, where d \geq 3 is fixed and n grows. We prove mean-field behavior around the critical probability p_c=1/(d-1). In…
The self-similar cluster fluctuations of directed bond percolation at the percolation threshold are studied using techniques borrowed from inter\-mit\-ten\-cy-related analysis in multi-particle production. Numerical simulations based on the…
We discuss the following type of results about critical Bernoulli percolation in high dimensions: The collection of clusters that do contain large (self-avoiding) loops in a large box is tight. The collection of these large loops has…
In this paper, we consider Bernoulli percolation on a locally finite, transitive and infinite graph (e.g. the hypercubic lattice $\mathbb{Z}^d$). We prove the following estimate, where $\theta_n(p)$ is the probability that there is a path…
While classical percolation is well understood, percolation effects in randomly packed or jammed structures are much less explored. Here we investigate both experimentally and theoretically the electrical percolation in a binary composite…
We investigate the scaling of the largest critical percolation cluster on a large d-dimensional torus, for nearest-neighbor percolation in high dimensions, or when d>6 for sufficient spread-out percolation. We use a relatively simple…
We consider Bernoulli percolation on a locally finite quasi-transitive unimodular graph and prove that two infinite clusters cannot have infinitely many pairs of vertices at distance 1 from one another or, in other words, that such graphs…
The Russo-Seymour-Welsh Theorem for Z^2 bond or T (triangular lattice) site percolation states that at criticality, for all fixed real {\lambda}, the probability of the existence of a horizontal occupied crossing of each rectangle with size…
We extend Smirnov's proof of the existence and conformal invariance of the scaling limit of critical site-percolation on the triangular lattice to particular sequences of periodic graphs with more arbitrary large-scale structure, obtained…
We consider the Bernoulli bond percolation process (with parameter $p$) on infinite graphs and we give a general criterion for bounded degree graphs to exhibit a non-trivial percolation threshold based either on a single isoperimetric…
In this paper we establish some relations between percolation on a given graph G and its geometry. Our main result shows that, if G has polynomial growth and satisfies what we call the local isoperimetric inequality of dimension d > 1, then…
Let $p_c(\mathbb{Q}_n)$ and $p_c(\mathbb{Z}^n)$ denote the critical values for nearest-neighbour bond percolation on the $n$-cube $\mathbb{Q}_n = \{0,1\}^n$ and on $\Z^n$, respectively. Let $\Omega = n$ for $\mathbb{G} = \mathbb{Q}_n$ and…
The two-dimensional dense O(n) loop model for $n=1$ is equivalent to the bond percolation and for $n=0$ to the dense polymers or spanning trees. We consider the boundary correlations on the half space and calculate the probability $P_b$…
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…