English
Related papers

Related papers: Planar percolation with a glimpse of Schramm-Loewn…

200 papers

For independent nearest-neighbour bond percolation on Z^d with d >> 6, we prove that the incipient infinite cluster's two-point function and three-point function converge to those of integrated super-Brownian excursion (ISE) in the scaling…

Probability · Mathematics 2009-09-25 Siva Athreya , Roger Tribe

We study Bernoulli percolations on random lattices of the half-plane obtained as local limit of uniform planar triangulations or quadrangulations. Using the characteristic spatial Markov property or peeling process of these random lattices…

Probability · Mathematics 2013-01-23 Omer Angel , Nicolas Curien

We use SLE(6) paths to construct a process of continuum nonsimple loops in the plane and prove that this process coincides with the full continuum scaling limit of 2D critical site percolation on the triangular lattice -- that is, the…

Probability · Mathematics 2009-11-11 Federico Camia , Charles M. Newman

Schramm's Locality Conjecture asserts that the value of the critical percolation parameter $p_c$ of a graph satisfying $p_c<1$ depends only on its local structure. In this note, we prove this conjecture in the particular case of transitive…

Probability · Mathematics 2022-05-23 Daniel Contreras , Sébastien Martineau , Vincent Tassion

We prove a formula, first obtained by Kleban, Simmons and Ziff using conformal field theory methods, for the (renormalized) density of a critical percolation cluster in the upper half-plane "anchored" to a point on the real line. The proof…

Mathematical Physics · Physics 2023-12-19 Federico Camia

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…

Probability · Mathematics 2015-02-11 Hugo Duminil-Copin , Vincent Tassion

The probability distribution for the number of top to bottom spanning clusters in Directed percolation in two and three dimensions appears to be universal and is of the form $P(n) \sim \exp(-\alpha n^2)$. We argue that $\alpha$ is a new…

Statistical Mechanics · Physics 2007-05-23 Parongama Sen , Somendra M. Bhattacharjee

Percolation on a one-dimensional lattice and fractals such as the Sierpinski gasket is typically considered to be trivial because they percolate only at full bond density. By dressing up such lattices with small-world bonds, a novel…

Disordered Systems and Neural Networks · Physics 2012-10-10 S. Boettcher , V. Singh , R. M. Ziff

Aims. We investigate how properties of the ensemble of superclusters in the cosmic web evolve with time. Methods. We perform numerical simulations of the evolution of the cosmic web using the LambdaCDM model in box sizes L0 = 1024, 512, 256…

Cosmology and Nongalactic Astrophysics · Physics 2019-03-13 J. Einasto , I. Suhhonenko , L. J. Liivamägi , M. Einasto

Two distinct distribution functions $P_{sp}(m)$ and $P_{ns}(m)$ of the scaled largest cluster sizes $m$ are obtained at the percolation threshold by numerical simulations, depending on the condition whether the lattice is actually spanned…

Disordered Systems and Neural Networks · Physics 2009-11-07 Parongama Sen

Kesten showed the exponential decay of percolation probability in the subcritical phase for the two-dimensional percolation model. This result implies his celebrated computation that $p_c=0.5$ for bond percolation in the square lattice, and…

Probability · Mathematics 2009-11-13 Yu Zhang

This is a study of percolation in the hyperbolic plane and on regular tilings in the hyperbolic plane. The processes discussed include Bernoulli site and bond percolation on planar hyperbolic graphs, invariant dependent percolations on such…

Probability · Mathematics 2008-11-26 Itai Benjamini , Oded Schramm

The existence of a quantum percolation threshold p_q<1 in the 2D quantum site-percolation problem has been a controversial issue for a long time. By means of a highly efficient Chebyshev expansion technique we investigate numerically the…

Strongly Correlated Electrons · Physics 2009-11-13 Gerald Schubert , Holger Fehske

This paper studies the critical and near-critical regimes of the planar random-cluster model on $\mathbb Z^2$ with cluster-weight $q\in[1,4]$ using novel coupling techniques. More precisely, we derive the scaling relations between the…

Probability · Mathematics 2020-12-01 Hugo Duminil-Copin , Ioan Manolescu

In the Constrained-degree percolation model on a graph $(\mathbb{V},\mathbb{E})$ there are a sequence, $(U_e)_{e\in\mathbb{E}}$, of i.i.d. random variables with distribution $U[0,1]$ and a positive integer $k$. Each bond $e$ tries to open…

We establish the sharpness of the percolation phase transition for a class of infinite-range weighted random connection models. The vertex set is given by a marked Poisson point process on $\mathbb{R}^d$ with intensity $\lambda>0$, where…

Probability · Mathematics 2025-12-29 Alejandro Caicedo , Leonid Kolesnikov

We study a model of an i.i.d.~random environment in general dimensions $d\ge 2$, where each site is equipped with one of two environments. The model comes with a parameter $p$ which governs the frequency of the first environment, and for…

Probability · Mathematics 2022-08-30 Mark Holmes , Thomas S. Salisbury

A simple, discrete, parametric model is proposed to describe conditional (correlated) deposition of particles on a surface and formation of a connecting (percolating) cluster. The surface changes spontaneously its properties (phase…

Statistical Mechanics · Physics 2007-05-23 Ana Proykova , Boris Karadjov

The critical phase of bond percolation on the random growing tree is examined. It is shown that the root cluster grows with the system size $N$ as $N^\psi$ and the mean number of clusters with size $s$ per node follows a power function $n_s…

Disordered Systems and Neural Networks · Physics 2011-04-21 Takehisa Hasegawa , Koji Nemoto

We consider long-range percolation on $\mathbb{Z}^d$, where the probability that two vertices at distance $r$ are connected by an edge is given by $p(r)=1-\exp[-\lambda(r)]\in(0,1)$ and the presence or absence of different edges are…

Probability · Mathematics 2011-01-10 Pieter Trapman
‹ Prev 1 4 5 6 7 8 10 Next ›