Related papers: Continuum Nonsimple Loops and 2D Critical Percolat…
We study the geometry of the critical clusters in fully coordinated percolation on the square lattice. By Monte Carlo simulations (static exponents) and normal mode analysis (dynamic exponents), we find that this problem is in the same…
The smart kinetic self-avoiding walk (SKSAW) is a random walk which never intersects itself and grows forever when run in the full-plane. At each time step the walk chooses the next step uniformly from among the allowable nearest neighbors…
We prove existence of the scaling limit of the invasion percolation cluster (IPC) on a regular tree. The limit is a random real tree with a single end. The contour and height functions of the limit are described as certain diffusive…
Iterative construction of a Sierpinski carpet or sponge is shown to be a critical phenomenon analogous to uncorrelated percolation. Critical exponents are derived or calculated (by random walks over the carpet or sponge at infinite…
Criticality is traditionally regarded as an unstable, fine-tuned fixed point of the renormalization group. We introduce an iterative bicolored percolation process in two dimensions and show that it can both preserve criticality and…
In this paper, we study the critical behavior of percolation on a configuration model with degree distribution satisfying an infinite second-moment condition, which includes power-law degrees with exponent $\tau \in (2,3)$. It is well known…
We evaluate the percolation threshold values for a realistic model of continuum segregated systems, where random spherical inclusions forbid the percolating objects, modellized by hard-core spherical particles surrounded by penetrable…
In dynamical percolation, the status of every bond is refreshed according to an independent Poisson clock. For graphs which do not percolate at criticality, the dynamical sensitivity of this property was analyzed extensively in the last…
The Schramm-Loewner evolution (SLE) is a powerful tool to describe fractal interfaces in 2D critical statistical systems. Yet the application of SLE is well established for statistical systems described by quantum field theories satisfying…
The scaling limits of a variety of critical two-dimensional lattice models are equal to the Schramm-Loewner evolution (SLE) for a suitable value of the parameter kappa. These lattice models have a natural parametrization of their random…
The site percolation on the triangular lattice stands out as one of the few exactly solved statistical systems. By initially configuring critical percolation clusters of this model and randomly reassigning the color of each percolation…
The random walk loop soup is a Poissonian ensemble of lattice loops; it has been extensively studied because of its connections to the discrete Gaussian free field, but was originally introduced by Lawler and Trujillo Ferreras as a discrete…
We study critical trajectories in the sphere for the $1/2$-Bernoulli's bending functional with length constraint. For every Lagrange multiplier encoding the conservation of the length during the variation, we show the existence of…
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…
Simulations of the self-avoiding walk (SAW) are performed in a half-plane and a cut-plane (the complex plane with the positive real axis removed) using the pivot algorithm. We test the conjecture of Lawler, Schramm and Werner that the…
We derive an exact, simple relation between the average number of clusters and the wrapping probabilities for two-dimensional percolation. The relation holds for periodic lattices of any size. It generalizes a classical result of Sykes and…
In long-range percolation on $\mathbb{Z}^d$, points $x$ and $y$ are connected by an edge with probability $1-\exp(-\beta\|x-y\|^{-d-\alpha})$, where $\alpha>0$ is fixed and $\beta \geq 0$ is a parameter. As $d$ and $\alpha$ vary, the model…
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…
We introduce a model of random interlacements made of a countable collection of doubly infinite paths on Z^d, d bigger or equal to 3. A non-negative parameter u measures how many trajectories enter the picture. This model describes in the…
Recently it has been demonstrated that the connectivity transition from microscopic connectivity to macroscopic connectedness, known as percolation, is generically announced by a cascade of microtransitions of the percolation order…