中文
相关论文

相关论文: One-arm exponent for critical 2D percolation

200 篇论文

We present a review of the recent progress on percolation scaling limits in two dimensions. In particular, we will consider the convergence of critical crossing probabilities to Cardy's formula and of the critical exploration path to…

概率论 · 数学 2008-10-08 Federico Camia

We prove that for supercritical percolation on every infinite transitive graph, the probability that the origin belongs to a finite cluster of size at least $n$ decays exponentially in $\Phi(n)$, where $\Phi$ is the isoperimetric function…

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…

概率论 · 数学 2015-07-31 Vincent Tassion

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…

概率论 · 数学 2013-06-10 Vincent Beffara , Hugo Duminil-Copin

A 1/L-expansion for percolation problems is proposed, where L is the lattice finite length. The square lattice with 27 different sizes L = 18, 22 ... 1594 is considered. Certain spanning probabilities were determined by Monte Carlo…

统计力学 · 物理学 2007-05-23 P. M. C. de Oliveira , R. A. Nobrega , D. Stauffer

It is natural to expect that there are only three possible types of scaling limits for the collection of all percolation interfaces in the plane: (1) a trivial one, consisting of no curves at all, (2) a critical one, in which all points of…

概率论 · 数学 2010-02-10 Federico Camia , Matthijs Joosten , Ronald Meester

We prove that the probability the cluster of the origin in a subcritical Poisson random connection model (RCM) has size at least $n$ decays exponentially as $n$ increases, under minimal assumptions. We extend a recent method of Vanneuville…

概率论 · 数学 2025-09-03 Frankie Higgs

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…

概率论 · 数学 2020-06-24 Zhongyang Li

We use the connection between bond percolation and SIR epidemics to establish lower bounds for the critical percolation probability in $2$ and $3$ dimensions as the range becomes large. The bound agrees with the conjectured asymptotics for…

概率论 · 数学 2016-03-15 Spencer Frei , Edwin Perkins

We examine the incipient infinite cluster (IIC) of critical percolation in regimes where mean-field behavior has been established, namely when the dimension d is large enough or when d>6 and the lattice is sufficiently spread out. We find…

概率论 · 数学 2015-05-13 Gady Kozma , Asaf Nachmias

Following H. Tomita and C. Murakami we propose an analytical model to predict critical probability of percolation. It is based on the excursion set theory which allows us to consider N-dimensional bounded regions. Details are given for the…

材料科学 · 物理学 2016-04-20 Emmanuel Roubin , Jean-Baptiste Colliat

We find that 2-dimensional (2-D) critical branched polymers with no impurities conclusively belong to the same universality class as 2-D random percolation clusters, although pure critical 3-D branched polymers do not belong to the 3-D…

统计力学 · 物理学 2007-05-23 H. H. Aragao-Rego , J. E. de Freitas , Liacir S. Lucena , G. M. Viswanathan

We consider invasion percolation on the square lattice. It has been proved by van den Berg, Peres, Sidoravicius and Vares, that the probability that the radius of a so-called pond is larger than n, differs at most a factor of order log n…

概率论 · 数学 2011-01-10 Jacob van den Berg , Antal A. Járai , Bálint Vágvölgyi

Making use of a recent complete calculation of a chiral six-point correlation function C(z) in a rectangle we calculate various quantities of interest for percolation (SLE parameter \kappa = 6) and many other two-dimensional critical…

数学物理 · 物理学 2011-09-13 Jacob J. H. Simmons , Peter Kleban , Steven M. Flores , Robert M. Ziff

The square lattice with central forces between nearest neighbors is isostatic with a subextensive number of floppy modes. It can be made rigid by the random addition of next-nearest neighbor bonds. This constitutes a rigidity percolation…

统计力学 · 物理学 2011-12-06 Wouter G. Ellenbroek , Xiaoming Mao

The statistical behavior of the size (or mass) of the largest cluster in subcritical percolation on a finite lattice of size $N$ is investigated (below the upper critical dimension, presumably $d_c=6$). It is argued that as $N \to \infty$…

统计力学 · 物理学 2009-10-31 Martin Z. Bazant

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…

数学物理 · 物理学 2009-09-29 E. S. Antonova , Yu. P. Virchenko

We obtain a new lower bound of 0.06576 for the 1-entanglement critical probability (in dimension 3), and prove that the critical point for the existence of a sphere surrounding the origin and intersecting only closed bonds in $\mathbb{Z}^d$…

概率论 · 数学 2021-12-08 Olivier Couronné

Consider supercritical long-range percolation on $\Z^d$ where two vertices $x,y \in \Z^d$ are connected with probability asymptotic to $\|x-y\|^{-s}$ for some $s>2d$. Conditioned that the origin is in the infinite cluster, we prove a shape…

概率论 · 数学 2026-04-29 Johannes Bäumler

Given $\omega\ge 1$, let $Z^2_{(\omega)}$ be the graph with vertex set $Z^2$ in which two vertices are joined if they agree in one coordinate and differ by at most $\omega$ in the other. (Thus $Z^2_{(1)}$ is precisely $Z^2$.) Let…

概率论 · 数学 2009-05-08 Bela Bollobas , Svante Janson , Oliver Riordan