English
Related papers

Related papers: Factorization of percolation density correlation f…

200 papers

Percolation clusters are random fractals whose geometrical and transport properties can be characterized with the help of probability distribution functions. Using renormalized field theory, we determine the asymptotic form of various of…

Statistical Mechanics · Physics 2015-05-13 Hans-Karl Janssen , Olaf Stenull

Percolation in systems made up of randomly placed impermeable grains is often examined in the context of system spanning clusters of connected solids forming above a relatively low critical grain density $\rho_{c1}$ or networks of…

Disordered Systems and Neural Networks · Physics 2025-10-10 D. J. Priour

We study the percolation model on Boltzmann triangulations using a generating function approach. More precisely, we consider a Boltzmann model on the set of finite planar triangulations, together with a percolation configuration (either…

Combinatorics · Mathematics 2019-08-15 Olivier Bernardi , Nicolas Curien , Grégory Miermont

The logarithmic conformal field theory describing critical percolation is further explored using Watts' determination of the probability that there exists a cluster connecting both horizontal and vertical edges. The boundary condition…

High Energy Physics - Theory · Physics 2009-02-02 David Ridout

We consider a directed percolation process on an ${\cal M}$ x ${\cal N}$ rectangular lattice whose vertical edges are directed upward with an occupation probability y and horizontal edges directed toward the right with occupation…

Statistical Mechanics · Physics 2007-05-23 L. C. Chen , F. Y. Wu

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…

Probability · Mathematics 2009-05-08 Bela Bollobas , Svante Janson , Oliver Riordan

We compare level-set percolation for Gaussian free fields (GFFs) defined on a rectangular subset of $\delta \mathbb{Z}^2$ to level-set percolation for GFFs defined on the corresponding metric graph as the mesh size $\delta$ goes to 0. In…

Probability · Mathematics 2020-01-20 Jian Ding , Mateo Wirth , Hao Wu

In Poisson percolation each edge becomes open after an independent exponentially distributed time with rate that decreases in the distance from the origin. As a sequel to our work on the square lattice, we describe the limiting shape of the…

Probability · Mathematics 2018-06-12 Irina Cristali , Matthew Junge , Rick Durrett

We study continuum percolation of overlapping circular discs of two sizes. We propose a phenomenological scaling equation for the increase in the effective size of the larger discs due to the presence of the smaller discs. The critical…

Statistical Mechanics · Physics 2012-05-03 Ajit C. Balram , Deepak Dhar

Percolation on a plane is usually associated with clusters spanning two opposite sides of a rectangular system. Here we investigate three-leg clusters generated on a square lattice and spanning the three sides of equilateral triangles. If…

Statistical Mechanics · Physics 2022-04-15 Zbigniew Koza

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

At the critical point in two dimensions, the number of percolation clusters of enclosed area greater than A is proportional to 1/A, with a proportionality constant C that is universal. We show theoretically (based upon Coulomb gas methods),…

Disordered Systems and Neural Networks · Physics 2007-05-23 John Cardy , Robert Ziff

Series expansion methods are used to study directed bond percolation clusters on the square lattice whose lateral growth is restricted by a wall parallel to the growth direction. The percolation threshold $p_c$ is found to be the same as…

Condensed Matter · Physics 2019-08-15 J W Essam , A J Guttmann , I Jensen , D TanlaKishani

We study site and bond percolation on directed simple random graphs with a given degree distribution and derive the expressions for the critical value of the percolation probability above which the giant strongly connected component emerges…

Combinatorics · Mathematics 2021-03-08 Femke van Ieperen , Ivan Kryven

We consider a generalized version of the correlation clustering problem, defined as follows. Given a complete graph $G$ whose edges are labeled with $+$ or $-$, we wish to partition the graph into clusters while trying to avoid errors: $+$…

Data Structures and Algorithms · Computer Science 2016-05-25 Gregory J. Puleo , Olgica Milenkovic

The probability of simultaneous occurence of at least k spanning clusters has been studied by Monte Carlo simulations on the 2D square lattice at the bond percolation threshold Pc=1/2. The calculated probabilities for free boundary…

Statistical Mechanics · Physics 2009-10-31 L. N. Shchur , S. S. Kosyakov

A new site percolation model, directed spiral percolation (DSP), under both directional and rotational (spiral) constraints is studied numerically on the square lattice. The critical percolation threshold $p_c\approx 0.655$ is found between…

Soft Condensed Matter · Physics 2009-11-10 S. B. Santra

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

We describe the critical window for percolation in the universality class of sparse growing random graphs. In our models, vertices arrive sequentially and connect independently to each earlier vertex $v$ with probability proportional to a…

Probability · Mathematics 2025-12-23 Joost Jorritsma , Pascal Maillard , Peter Mörters

For a given shape $S$ in the plane, one can ask what is the lowest possible density of a point set $P$ that pierces ("intersects", "hits") all translates of $S$. This is equivalent to determining the covering density of $S$ and as such is…

Computational Geometry · Computer Science 2021-08-27 Adrian Dumitrescu , Josef Tkadlec