Related papers: Percolation with constant freezing
It is proposed that the $O(n)$ spin and geometrical percolation models can help to study the QCD phase diagram due to the universality properties of the phase transition. In this paper, correlations and fluctuations of various sizes of…
It is shown here that the percolation cluster that emerges from the percolation process on infinite perfect binary trees, is genuinely an encoding scheme for an infinite set of symbols. The average codeword length and the entropy of such an…
We present a systematic study of dynamical heterogeneity in a model for permanent gels, upon approaching the gelation threshold. We find that the fluctuations of the self intermediate scattering function are increasing functions of time,…
We show that for any Cayley graph, the probability (at any $p$) that the cluster of the origin has size n decays at a well-defined exponential rate (possibly 0). For general graphs, we relate this rate being positive in the supercritical…
Let A be the annulus in R^2 centered at the origin with inner and outer radii r(1-\epsilon) and r, respectively. Place points {x_i} in R^2 according to a Poisson process with intensity 1 and let G_A be the random graph with vertex set {x_i}…
We present a unified theory of fracture in disordered brittle media that reconciles apparently conflicting results reported in the literature. Our renormalization group based approach yields a phase diagram in which the percolation fixed…
We show that when percolation produces infinitely many infinite clusters on a Cayley graph, one cannot distinguish the clusters from each other by any invariantly defined property. This implies that uniqueness of the infinite cluster is…
Our object of study is the asymptotic growth of heaviest paths in a charged (weighted with signed weights) complete directed acyclic graph. Edge charges are i.i.d. random variables with common distribution $F$ supported on $[-\infty,1]$…
In this paper, we study the random walk on a supercritical branching process with an uncountable and unbounded set of types supported on the $d$-regular tree $\mathbb{T}_d$ ($d\geq 3$), namely the cluster $\mathcal{C}_\circ^h$ of the root…
The study of the phase transition in planar FK-percolation on the square lattice has seen significant recent breakthroughs. The model undergoes a change in the nature of its phase transition at $q = 4$, transitioning from a continuous to a…
The talk presented at ICMP 97 focused on the scaling limits of critical percolation models, and some other systems whose salient features can be described by collections of random lines. In the scaling limit we keep track of features seen…
We investigate the percolation properties of a planar reinforced network model. In this model, at every time step, every vertex chooses $k \ge 1$ incident edges, whose weight is then increased by 1. The choice of this $k$-tuple occurs…
We study first-passage percolation (FPP) on the square lattice. The model is defined using i.i.d. nonnegative random edge-weights $(t_e)$ associated to the nearest neighbor edges of $\mathbb{Z}^2$. The passage time between vertices $x$ and…
The classical definitions of the Incipient Infinite Cluster (IIC) of percolation consist in conditioning the origin on being connected to radius $n$ and letting $n$ go to infinity. We provide a short proof of that convergence in the planar…
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…
The BFW model introduced by Bohman, Frieze, and Wormald [Random Struct. Algorithms, 25, 432 (2004)] and recently investigated in the framework of discontinuous percolation by Chen and D'Souza [Phys. Rev. Lett., 106, 115701 (2011)], is…
We study statistical properties of a one dimensional infinite system of coalescing particles. Each particle moves with constant velocity $\pm v$ towards its closest neighbor and merges with it upon collision. We propose a mean-field theory…
For ordinary (independent) percolation on a large class of lattices it is well known that below the critical percolation parameter $p_c$ the cluster size distribution has exponential decay and that power-law behavior of this distribution…
An important conjecture in percolation theory is that almost surely no infinite cluster exists in critical percolation on any transitive graph for which the critical probability is less than 1. Earlier work has established this for the…
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…