相关论文: Is critical 2D percolation universal?

Zhang found a simple, elegant argument deducing the non-existence of an infinite open cluster in certain lattice percolation models (for example, p=1/2 bond percolation on the square lattice) from general results on the uniqueness of an…

k-core percolation is an extension of the concept of classical percolation and is particularly relevant to understand the resilience of complex networks under random damage. A new analytical formalism has been recently proposed to deal with…

I construct a two-dimensional lattice on which the inhomogeneous site percolation threshold is exactly calculable and use this result to find two more lattices on which the site thresholds can be determined. The primary lattice studied…

Critical points and singularities are encountered in the study of critical phenomena in probability and physics. We present recent results concerning the values of such critical points and the nature of the singularities for two prominent…

We show that the critical probability for percolation on a d-regular non-amenable graph of large girth is close to the critical probability for percolation on an infinite d-regular tree. This is a special case of a conjecture due to O.…

Recent work in percolation has led to exact solutions for the site and bond critical thresholds of many new lattices. Here we show how these results can be extended to other classes of graphs, significantly increasing the number and variety…

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…

The rigidity transition occurs when, as the density of microscopic components is increased, a disordered medium becomes able to transmit and ensure macroscopic mechanical stability, owing to the appearance of a space-spanning rigid…

Percolation theory is usually applied to lattices with a uniform probability p that a site is occupied or that a bond is closed. The more general case, where p is a function of the position x, has received less attention. Previous studies…

The k-neighbor graph is a directed percolation model on the hypercubic lattice Z d in which each vertex independently picks exactly k of its 2d nearest neighbors at random, and we open directed edges towards those. We prove that the…

The problem of percolation along sites of square lattice is studied. The number of contours being external boundaries for finite clusters has been estimated using geometric considerations. This estimation makes it possible to determine more…

We consider several aspects of the scaling limit of percolation on random planar triangulations, both finite and infinite. The equivalents for random maps of Cardy's formula for the limit under scaling of various crossing probabilities are…

Fitting percolation into the conformal field theory framework requires showing that connection probabilities have a conformally invariant scaling limit. For critical site percolation on the triangular lattice, we prove that the probability…

We study loop percolation models in two and in three space dimensions, in which configurations of occupied bonds are forced to form closed loop. We show that the uncorrelated occupation of elementary plaquettes of the square and the simple…

By use of conformal field theory, we discover several exact factorizations of higher-order density correlation functions in critical two-dimensional percolation. Our formulas are valid in the upper half-plane, or any conformally equivalent…

We study directed rigidity percolation (equivalent to directed bootstrap percolation) on three different lattices: square, triangular, and augmented triangular. The first two of these display a first-order transition at p=1, while the…

We study the percolative properties of bi-dimensional systems generated by a random sequential adsorption of line-segments on a square lattice. As the segment length grows, the percolation threshold decreases, goes through a minimum and…

Recently Mertens and Moore [arXiv:1909.01484v1] showed that site percolation "is odd." By this they mean that on an $M\times N$ square lattice the number of distinct site configurations that allow for vertical percolation is odd. We report…

Critical site percolation on the triangular lattice is described by the Yang-Baxter solvable dilute $A_2^{(2)}$ loop model with crossing parameter specialized to $\lambda=\frac\pi3$, corresponding to the contractible loop fugacity…

We reinvestigate the 2D problem of the inhomogeneous incipient infinite cluster where, in an independent percolation model, the density decays to p_c with an inverse power, \lambda, of the distance to the origin. Assuming the existence of…