Related papers: Percolation on uniform infinite planar maps
The existence probability $E_p$ and the percolation probability $P$ of the bond percolation on rectangular domains with different aspect ratios $R$ are studied via the mapping functions between systems with different aspect ratios. The…
A comparison technique for finite random walks on finite graphs is introduced, using the well-known interlacing method. It yields improved return probability bounds. A key feature is the incorporation of parts of the spectrum of the…
We consider first passage percolation on sparse random graphs with prescribed degree distributions and general independent and identically distributed edge weights assumed to have a density. Assuming that the degree distribution satisfies a…
Let $d\geq 2$. We consider an i.i.d. supercritical bond percolation on $\mathbb{Z}^d$, every edge is open with a probability $p>p_c(d)$, where $p_c(d)$ denotes the critical point. We condition on the event that $0$ belongs to the infinite…
The values obtained experimentally for the conductivity critical exponent in numerous percolation systems, in which the interparticle conduction is by tunnelling, were found to be in the range of $t_0$ and about $t_0+10$, where $t_0$ is the…
We prove existence of the scaling limit of the invasion percolation cluster (IPC) on a regular tree. The limit is a random real tree with a single end. The contour and height functions of the limit are described as certain diffusive…
We present a coupled decreasing sequence of random walks on $ \mathbb Z $ that dominates the edge process of oriented-bond percolation in two dimensions. Using the concept of "random walk in a strip ", we construct an algorithm that…
We conjecture an exact form for an universal ratio of four-point cluster connectivities in the critical two-dimensional $Q$-color Potts model. We also provide analogous results for the limit $Q\rightarrow 1$ that corresponds to percolation…
Let $A$ be an arc on the boundary of the unit disk $U$. We prove an asymptotic formula for the probability that there is a percolation cluster $K$ for critical site percolation on the triangular grid in $U$ which intersects $A$ and such…
Extensive Monte-Carlo simulations were performed to evaluate the excess number of clusters and the crossing probability function for three-dimensional percolation on the simple cubic (s.c.), face-centered cubic (f.c.c.), and body-centered…
We use a growth procedure for binary trees due to Luczak and Winkler, a bijection between binary trees and irreducible quadrangulations of the hexagon due to Fusy, Poulalhon and Schaeffer, and the classical angular mapping between…
The incipient infinite cluster (IIC) measure is the percolation measure at criticality conditioned on the cluster of the origin to be infinite. Using the lace expansion, we construct the IIC measure for high-dimensional percolation models…
In recent years, important progress has been made in the field of two-dimensional statistical physics. One of the most striking achievements is the proof of the Cardy-Smirnov formula. This theorem, together with the introduction of…
We study the alternating $k$-arm incipient infinite cluster (IIC) of site percolation on the triangular lattice $\mathbb{T}$. Using Camia and Newman's result that the scaling limit of critical site percolation on $\mathbb{T}$ is CLE$_6$, we…
Percolation in an information-theoretically secure graph is considered where both the legitimate and the eavesdropper nodes are distributed as Poisson point processes. For both the path-loss and the path-loss plus fading model, upper and…
The upper estimate of the percolation threshold of the Bernoulli random field on the hexagonal lattice is found. It is done on the basis of the cluster decomposition. Each term of the decomposition is estimated using the number estimate 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 consider independent and $m$-dependent two-dimensional oriented site percolation with open-site density close to one started from Bernoulli product measures. We show that the probability of an occupied interval in the former process…
Triadic percolation turns bond percolation into a dynamical problem governed by an effective one-dimensional unimodal map. We show that the geometry of superstable cycles provides a direct, map-agnostic probe of local nonlinearity:…
We study random points on the real line generated by the eigenvalues in unitary invariant random matrix ensembles or by more general repulsive particle systems. As the number of points tends to infinity, we prove convergence of the…