Related papers: Hyperscaling for oriented percolation in 1+1 space…
We derive three critical exponents for Bernoulli site percolation on the on the Uniform Infinite Planar Triangulation (UIPT). First we compute explicitly the probability that the root cluster is infinite. As a consequence, we show that the…
A random hopping on a fractal network with dimension slightly above one, $d = 1 + \epsilon$, is considered as a model of transport for conducting polymers with nonmetallic conductivity. Within the real space renormalization group method of…
We study Mandelbrot's percolation process in dimension $d \geq 2$. The process generates random fractal sets by an iterative procedure which starts by dividing the unit cube $[0,1]^d$ in $N^d$ subcubes, and independently retaining or…
Universality, encompassing critical exponents, scaling functions, and dimensionless quantities, is fundamental to phase transition theory. In finite systems, universal behaviors are also expected to emerge at the pseudocritical point.…
We provide a new proof of the sharpness of the phase transition for nearest-neighbour Bernoulli percolation. More precisely, we show that - for $p<p_c$, the probability that the origin is connected by an open path to distance $n$ decays…
In this paper we study anisotropic oriented percolation on $\mathbb{Z}^d$ for $d\geq 4$ and show that the local condition for phase transition is closely related to the mean-field condition. More precisely, we show that if the sum of the…
We prove the sharpness of the phase transition for speed in the biased random walk on the supercritical percolation cluster on Z^d. That is, for each d at least 2, and for any supercritical parameter p > p_c, we prove the existence of a…
We prove that the probability of crossing a large square in quenched Voronoi percolation converges to 1/2 at criticality, confirming a conjecture of Benjamini, Kalai and Schramm from 1999. The main new tools are a quenched version of the…
We present Monte Carlo estimates for site and bond percolation thresholds in simple hypercubic lattices with 4 to 13 dimensions. For d<6 they are preliminary, for d >= 6 they are between 20 to 10^4 times more precise than the best previous…
We study oriented percolation on random causal triangulations, those are random planar graphs obtained roughly speaking by adding horizontal connections between vertices of an infinite tree. When the underlying tree is a geometric…
The two-dimensional site percolation problem is studied by transfer-matrix methods on finite-width strips with free boundary conditions. The relationship between correlation-length amplitudes and critical indices, predicted by conformal…
We provide the first nontrivial upper bound for the chemical distance exponent in two-dimensional critical percolation. Specifically, we prove that the expected length of the shortest horizontal crossing path of a box of side length $n$ in…
Two dimensional condensed matter is realised in increasingly diverse forms that are accessible to experiment and of potential technological value. The properties of these systems are influenced by many length scales and reflect both generic…
The probability distribution of random walks on linear structures generated by random walks in $d$-dimensional space, $P_d(r,t)$, is analytically studied for the case $\xi\equiv r/t^{1/4}\ll1$. It is shown to obey the scaling form…
We consider level-set percolation for the Gaussian membrane model on $\mathbb{Z}^d$, with $d \geq 5$, and establish that as $h \in \mathbb{R}$ varies, a non-trivial percolation phase transition for the level-set above level $h$ occurs at…
We apply the critical geometry approach for bounded critical phenomena [1] to $3d$ percolation. The functional shape of the order parameter profile $\phi$ is related via the fractional Yamabe equation to its scaling dimension…
Randomly diluted quantum boson and spin models in two dimensions combine the physics of classical percolation with the well-known dimensionality dependence of ordering in quantum lattice models. This combination is rather subtle for models…
In r-neighbour bootstrap percolation on the vertex set of a graph G, vertices are initially infected independently with some probability p. At each time step, the infected set expands by infecting all uninfected vertices that have at least…
Consider percolation on $T\times \mathbb{Z}^d$, the product of a regular tree of degree $k\geq 3$ with the hypercubic lattice $\mathbb{Z}^d$. It is known that this graph has $0<p_c<p_u<1$, so that there are non-trivial regimes in which…
Consider long-range Bernoulli percolation on $\mathbb{Z}^d$ in which we connect each pair of distinct points $x$ and $y$ by an edge with probability $1-\exp(-\beta\|x-y\|^{-d-\alpha})$, where $\alpha>0$ is fixed and $\beta\geq 0$ is a…