Related papers: Percolation on an infinitely generated group
We consider cumulative merging percolation (CMP), a long-range percolation process describing the iterative merging of clusters in networks, depending on their mass and mutual distance. For a specific class of CMP processes, which…
Our main result is an extension of Pansu's theorem to random metrics, where the edges of the Cayley are i.i.d. random variable with some finite exponential moment. Based on a previous work by the second author, the proof relies on…
We consider the Boolean model with random radii based on Cox point processes. Under a condition of stabilization for the random environment, we establish existence and non-existence of subcritical regimes for the size of the cluster at the…
The development of percolation theory was historically shaped by its numerous applications in various branches of science, in particular in statistical physics, and was mainly constrained to the case of Euclidean spaces. One of its central…
Scale-free percolation is a percolation model on $\mathbb{Z}^d$ which can be used to model real-world networks. We prove bounds for the graph distance in the regime where vertices have infinite degrees. We fully characterize transience vs.…
We consider bond percolation on the square lattice with perfectly correlated random probabilities. According to scaling considerations, mapping to a random walk problem and the results of Monte Carlo simulations the critical behavior of the…
A range of percolation models of cluster systems of composites is discussed. In the models the parameters of the clusters of a substance and inner boundaries were obtained by the Monte Carlo method, and the possibility of affecting the…
We investigate continuum percolation for Cox point processes, that is, Poisson point processes driven by random intensity measures. First, we derive sufficient conditions for the existence of non-trivial sub- and super-critical percolation…
We provide several simple recursive formulae for the moment sequence of infinite Bernoulli convolution. We relate moments of one infinite Bernoulli convolution with others having different but related parameters. We give examples relating…
We show the existence of generalized clusters of a finite or even infinite number of sets, with minimal total perimeter and given total masses, in metric measure spaces homogeneous with respect to a group acting by measure preserving…
The existence (or not) of infinite clusters is explored for two stochastic models of intersecting line segments in $d \ge 2$ dimensions. Salient features of the phase diagram are established in each case. The models are based on site…
We introduce notions of dimension of an infinite group, or more generally, a metric space, defined using percolation. Roughly speaking, the percolation dimension $pdim(G)$ of a group $G$ is the fastest rate of decay of a symmetric…
In this paper we study percolation on a roughly transitive graph G with polynomial growth and isoperimetric dimension larger than one. For these graphs we are able to prove that p_c < 1, or in other words, that there exists a percolation…
We consider Bernoulli bond percolation on oriented regular trees, where besides the usual short bonds, all bonds of a certain length are added. Independently, short bonds are open with probability $p$ and long bonds are open with…
Random-cluster measures on infinite regular trees are studied in conjunction with a general type of `boundary condition', namely an equivalence relation on the set of infinite paths of the tree. The uniqueness and non-uniqueness of…
A construction as a growth process for sampling of the uniform infinite planar triangulation (UIPT), defined in a previous paper, is given. The construction is algorithmic in nature, and is an efficient method of sampling a portion of the…
A split tree of cardinality $n$ is constructed by distributing $n$ "balls" in a subset of vertices of an infinite tree which encompasses many types of random trees such as $m$-ary search trees, quad trees, median-of-$(2k+1)$ trees,…
Aldous constructed a growth process for the binary tree where clusters freeze as soon as they become infinite. It was pointed out by Benjamini and Schramm that such a process does not exist for the square lattice. This motivated us to…
A generalization of the Renormalization Group, which describes order-parameter fluctuations in finite systems, is developed in the specific context of percolation. This ``Stochastic Renormalization Group'' (SRG) expresses statistical…
The basic notion of percolation in physics assumes the emergence of a giant connected (percolation) cluster in a large disordered system when the density of connections exceeds some critical value. Until recently, the percolation phase…