Related papers: The Largest Cluster in Subcritical Percolation
We consider a $d$-dimensional correlated percolation problem of sites {\em not} visited by a random walk on a hypercubic lattice $L^d$ for $d=3$, 4 and 5. The length of the random walk is ${\cal N}=uL^d$. Close to the critical value…
We investigate the problem of growing clusters, which is modeled by two dimensional disks and three dimensional droplets. In this model we place a number of seeds on random locations on a lattice with an initial occupation probability, $p$.…
The study of the Ising model from a percolation perspective has played a significant role in the modern theory of critical phenomena. We consider the celebrated square-lattice Ising model and construct percolation clusters by placing bonds,…
We study Bernoulli bond percolation on a random recursive tree of size $n$ with percolation parameter $p(n)$ converging to $1$ as $n$ tends to infinity. The sizes of the percolation clusters are naturally stored in a tree. We prove…
High-density (HD) percolation describes the percolation over specific $\kappa$ -clusters, which are the compact sets of sites each connected to $\kappa$ nearest filled sites at least. It takes place in the classical patterns of…
For the size of the largest component in a supercritical random geometric graph, this paper estimates its expectation which tends to a polynomial on a rate of exponential decay, and sharpens its asymptotic result with a central limit…
A random growth lattice filling model of percolation with touch and stop growth rule is developed and studied numerically on a two dimensional square lattice. Nucleation centers are continuously added one at a time to the empty sites and…
We present a new unified theory of critical finite-size scaling for lattice statistical mechanical models with periodic boundary conditions above the upper critical dimension. Our theory is based on recent mathematically rigorous results…
We consider long-range Bernoulli bond percolation on the $d$-dimensional hierarchical lattice in which each pair of points $x$ and $y$ are connected by an edge with probability $1-\exp(-\beta\|x-y\|^{-d-\alpha})$, where $0<\alpha<d$ is…
We consider an infinite-dimensional stochastic clustering model on $\mathbb{R}$. In discrete time, each point of a unit-intensity simple point process moves halfway toward either of its left or right neighbors, chosen uniformly at random.…
In this paper we consider a superprocess being a measure-valued diffusion corresponding to the equation $u_{t}=Lu+\alpha u-\beta u^{2}$, where $L$ is the infinitesimal operator of the \emph{Ornstein-Uhlenbeck process} and…
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…
We study a process termed "agglomerative percolation" (AP) in two dimensions. Instead of adding sites or bonds at random, in AP randomly chosen clusters are linked to all their neighbors. As a result the growth process involves a diverging…
We study site percolation on Angel & Schramm's uniform infinite planar triangulation. We compute several critical and near-critical exponents, and describe the scaling limit of the boundary of large percolation clusters in all regimes…
The concept of midpoint percolation has recently been applied to characterize the double percolation transitions in negatively curved structures. Regular $d$-dimensional hypercubic lattices are in the present work investigated using the…
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 have investigated both site and bond percolation on two dimensional lattice under the random rule and the product rule respectively. With the random rule, sites or bonds are added randomly into the lattice. From two candidates picked…
The persistence probability, $P_C(t)$, of a cluster to remain unaggregated is studied in cluster-cluster aggregation, when the diffusion coefficient of a cluster depends on its size $s$ as $D(s) \sim s^\gamma$. In the mean-field the problem…
The fractal structure and scaling properties of a 2d slice of the 3d Ising model is studied using Monte Carlo techniques. The percolation transition of geometric spin (GS) clusters is found to occur at the Curie point, reflecting the…
The more exact upper estimate of the percolation threshold for the {\it site problem} on the quadratic lattice ${\Bbb Z}^2$ have been found on the basis of the cluster decomposition. It is done by the number estimate of cycles on ${\Bbb…