English
Related papers

Related papers: The Largest Cluster in Subcritical Percolation

200 papers

We study scaling limits of a family of planar random growth processes in which clusters grow by the successive aggregation of small particles. In these models, clusters are encoded as a composition of conformal maps and the location of each…

Probability · Mathematics 2022-11-08 James Norris , Vittoria Silvestri , Amanda Turner

We analyze the critical connectivity of systems of penetrable $d$-dimensional spheres having size distributions in terms of weighed random geometrical graphs, in which vertex coordinates correspond to random positions of the sphere centers…

Statistical Mechanics · Physics 2015-08-11 Claudio Grimaldi

We perform large eddy simulations of flow past a circular cylinder for the Reynolds number ($Re$) range, $2\times 10^3 \leq Re \leq 4\times10^5$, spanning subcritical, critical and supercritical regimes. We investigate the spanwise…

Fluid Dynamics · Physics 2024-01-05 Gaurav Chopra , Sanjay Mittal , R. I. Sujith

I consider a one dimensional system of particles which interact through a hard core of diameter $\si$ and can connect to each other if they are closer than a distance $d$. The mean cluster size increases as a function of the density $\rho$…

Statistical Mechanics · Physics 2009-10-28 Alon Drory

In high dimensional percolation at parameter $p < p_c$, the one-arm probability $\pi_p(n)$ is known to decay exponentially on scale $(p_c - p)^{-1/2}$. We show the same statement for the ratio $\pi_p(n) / \pi_{p_c}(n)$, establishing a form…

Probability · Mathematics 2021-08-02 Shirshendu Chatterjee , Jack Hanson , Philippe Sosoe

We investigate the behavior of large connected components in the Poisson Random Connection model in non-critical regimes with any bounded connection function. We show that the asymptotic size of the largest component restricted to a window…

Probability · Mathematics 2026-05-19 Niclas Küpper , Mathew D. Penrose

Consider a uniform expanders family G_n with a uniform bound on the degrees. It is shown that for any p and c>0, a random subgraph of G_n obtained by retaining each edge, randomly and independently, with probability p, will have at most one…

Probability · Mathematics 2007-05-23 Noga Alon , Itai Benjamini , Alan Stacey

We calculate the distribution of the size of the percolating cluster on a tree in the subcritical, critical and supercritical phase. We do this by exploiting a mapping between continuum trees and Brownian excursions, and arrive at a…

Statistical Mechanics · Physics 2016-10-05 Francesc Font-Clos , Nicholas R. Moloney

We investigate the distribution of clusters of galaxies and determine the cluster correlation function and power spectrum. Clusters of galaxies located in rich superclusters with at least 8 members form a quasiregular network of…

Astrophysics · Physics 2007-05-23 Jaan Einasto

In this paper, we study independent (Bernoulli) bond percolation in dimensions $d \ge 2$, focusing on the maximum diameter of finite clusters in the non-critical regime ($p\neq p_c$). We prove that the maximum diameter $R_n$ satisfies $R_n…

Probability · Mathematics 2026-01-22 Kaito Kobayashi

We define the $Q$-factor in the percolation problem as the quotient of the size of the largest cluster and the average size of all clusters. As the occupation probability $p$ is increased, the $Q$-factor for the system size $L$ grows…

Statistical Mechanics · Physics 2024-07-22 Asim Ghosh , S. S. Manna , Bikas K. Chakrabarti

We study the volume of the critical clusters for the percolation of the level sets of the Gaussian free field on metric graphs. On $\mathbb{Z}^d$ below the upper-critical dimension $d=6$, we show that the largest such cluster in a box of…

Probability · Mathematics 2024-12-10 Alexander Drewitz , Alexis Prévost , Pierre-François Rodriguez

We study the bond percolation on finite graphs induced by the level-sets of zero-average Gaussian free field on the associated metric graph above a given height (level) parameter $h \in \mathbb{R}$. We characterize the near- and…

Probability · Mathematics 2026-01-13 Subhajit Goswami , Dipranjan Pal

Persistence is considered in diffusion--limited cluster--cluster aggregation, in one dimension and when the diffusion coefficient of a cluster depends on its size $s$ as $D(s) \sim s^\gamma$. The empty and filled site persistences are…

Statistical Mechanics · Physics 2016-08-16 E. K. O. Hellén , M. J. Alava

We consider Bernoulli bond percolation on a large scale-free tree in the supercritical regime, meaning informally that there exists a giant cluster with high probability. We obtain a weak limit theorem for the sizes of the next largest…

Probability · Mathematics 2016-03-04 Jean Bertoin , Geronimo Uribe Bravo

We consider bond percolation on the square lattice with perfectly correlated random probabilities. According to scaling considerations, mapping to a random walk problem and the results of Monte Carlo simulations the critical behavior of the…

Statistical Mechanics · Physics 2009-11-07 Róbert Juhász , Ferenc Iglói

We consider the percolation problem of sites on an $L\times L$ square lattice with periodic boundary conditions which were unvisited by a random walk of $N=uL^2$ steps, i.e. are vacant. Most of the results are obtained from numerical…

Statistical Mechanics · Physics 2021-03-24 Amit Federbush , Yacov Kantor

The partition function of the finite $1+\epsilon$ state Potts model is shown to yield a closed form for the distribution of clusters in the immediate vicinity of the percolation transition. Various important properties of the transition are…

Statistical Mechanics · Physics 2009-10-30 Joseph Rudnick , Paisan Nakmahachalasint , George Gaspari

We consider a stationary random field indexed by an increasing sequence of subsets of $\mathbb{Z}^d$ obeying a very broad geometrical assumption on how the sequence expands. Under certain mixing and local conditions, we show how the tail…

Probability · Mathematics 2022-01-19 Anders Rønn-Nielsen , Mads Stehr

We study random subgraphs of the $n$-cube $\{0,1\}^n$, where nearest-neighbor edges are occupied with probability $p$. Let $p_c(n)$ be the value of $p$ for which the expected cluster size of a fixed vertex attains the value $\lambda…

Probability · Mathematics 2007-05-23 Christian Borgs , Jennifer T. Chayes , Remco van der Hofstad , Gordon Slade , Joel Spencer