Related papers: A crossing probability for critical percolation in…
We prove that the standard Russo-Seymour-Welsh theory is valid for Voronoi percolation. This implies that at criticality the crossing probabilities for rectangles are bounded by constants depending only on their aspect ratio. This result…
Building on the identification of the scaling limit of the critical percolation exploration process as a Schramm-Loewner Evolution, we derive a PDE characterization for the crossing probability of an annulus.
We give mathematical proofs to a number of statements which appeared in the series of papers by Kleban, Simmons and Ziff where they computed the probabilities of several percolation crossing events.
In this paper we investigate the critical probability $p_c(Q_n,r)$ for bootstrap percolation with the infection threshold $r$ on the $n$-dimensional hypercube $Q_n$ with vertex set $V(Q_n)=\{0,1\}^n$ and edges connecting the pairs at…
In Bernoulli bond percolation on the Cartesian product graph of a $d$-regular tree and a line, we give an upper bound for the critical probability $p_c$.
We present results of a numerical simulation of the $q$-state random bond Potts model in two dimensions and for large $q$. In particular, care is taken to study the crossover from the pure model to the random model, as well as the crossover…
We consider high-dimensional percolation at the critical threshold. We condition the origin to be disjointly connected to two points, $x$ and $x'$, and subsequently take the limit as $|x|$, $|x'|$ as well as $|x-x'|$ diverge to infinity.…
We consider a family of percolation models in which geometry and connectivity are defined by two independent random processes. Such models merge characteristics of discrete and continuous percolation. We develop an algorithm allowing…
In high dimensional percolation at parameter $p < p_c$, the one-arm probability $\pi_p(n)$ is known to decay exponentially on scale $(p_c - p)^{-1/2}$. We show the same statement for the ratio $\pi_p(n) / \pi_{p_c}(n)$, establishing a form…
I consider a one dimensional system of particles which interact through a hard core of diameter $\si$ and can connect to each other if they are closer than a distance $d$. The mean cluster size increases as a function of the density $\rho$…
The probability that the cluster of the origin in critical site percolation on the triangular grid has diameter larger than $R$ is proved to decay like $R^{-5/48}$ as $R\to\infty$.
We report on a possible crossover of a non universal quantity at the upper critical dimensionality in the field of percolation. Plotting recent estimates for site percolation thresholds of hypercubes in dimension 6< d< 13 against…
We continue our study of the chemical (graph) distance inside large critical percolation clusters in dimension two. We prove new estimates, which involve the three-arm probability, for the point-to-surface and point-to-point distances. We…
The Curie-Weiss Potts model is a mean field version of the well-known Potts model. In this model, the critical line $\beta = \beta_c (h)$ is explicitly known and corresponds to a first order transition when $q > 2$. In the present paper we…
In this paper, we compute the next-nearest-neighboring site percolation (Connections exist not only between nearest-neighboring sites, but also between next-nearest-neighboring sites.) probabilities Pc on the two-dimensional Sierpinski…
We present a general method for predicting bond percolation thresholds and critical surfaces for a broad class of two-dimensional periodic lattices, reproducing many known exact results and providing excellent approximations for several…
Numerical investigation of critical exponents on a hypercubic with L^d random sites with L up to $33 and d up to 7 show that above the critical dimension the phase transitions in Ising model and percolation are not alike.
The analysis of extensive numerical data for the percolation probabilities of incipient spanning clusters in two dimensional percolation at criticality are presented. We developed an effective code for the single-scan version of the…
In a geometric inhomogeneous random graph vertices are given by the points of a Poisson process and are equipped with independent weights following a heavy tailed distribution. Any pair of distinct vertices is independently forming an edge…
A necessary and sufficient condition is established for the strict inequality $p_c(G_*)<p_c(G)$ between the critical probabilities of site percolation on a quasi-transitive, plane graph $G$ and on its matching graph $G_*$. It is assumed…