Related papers: Square lattice site percolation thresholds for com…
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…
We theoretically investigate the quantum percolation problem on Lieb lattices in two and three dimensions. We study the statistics of the energy levels through random matrix theory, and determine the level spacing distributions, which, with…
We show the existence of a scaling limit for the crossing probabilities on the square lattice in an equilateral triangle for the critical percolation. We also show that Cardy's formula does not hold on the square lattice for the critical…
In this paper, I compute the inhomogeneous (multi-probability) bond critical surfaces for the (4,6,12) and (3^4,6) lattices using the linearity approximation described in (Scullard and Ziff, J. Stat. Mech. P03021), implemented as a…
The main purpose of percolation theory is to model phase transitions in a variety of random systems, which is highly valuable in fields related to materials physics, biology, or otherwise unrelated areas like oil extraction or even quantum…
The analysis of extensive numerical data for the percolation probabilities of incipient spanning clusters in two dimensional percolation at criticality are presented. We developed an effective code for the single-scan version of the…
We present exact calculations of the average number of connected clusters per site, $<k>$, as a function of bond occupation probability $p$, for the bond percolation problem on infinite-length strips of finite width $L_y$, of the square,…
The site percolation threshold for the random Voronoi network is determined numerically for the first time, with the result p_c = 0.71410 +/- 0.00002, using Monte-Carlo simulation on periodic systems of up to 40000 sites. The result is very…
Covering a graph or a lattice with non-overlapping dimers is a problem that has received considerable interest in areas such as discrete mathematics, statistical physics, chemistry and materials science. Yet, the problem of percolation on…
We study site percolation on a square lattice with random compact diamond-shaped neighborhoods. Each site $s$ is connected to others within a neighborhood in the shape of a diamond of radius $r_s$, where $r_s$ is uniformly chosen from the…
A wide variety of methods have been used to compute percolation thresholds. In lattice percolation, the most powerful of these methods consists of microcanonical simulations using the union-find algorithm to efficiently determine the…
We investigate percolation on a randomly directed lattice, an intermediate between standard percolation and directed percolation, focusing on the isotropic case in which bonds on opposite directions occur with the same probability. We…
The probability distributions of the masses of the clusters spanning from top to bottom of a percolating lattice at the percolation threshold are obtained in all dimensions from two to five. The first two cumulants and the exponents for the…
We present percolation thresholds calculated numerically with the eigenvalue formulation of the method of critical polynomials; developed in the last few years, it has already proven to be orders of magnitude more accurate than traditional…
We propose two schemes to achieve fast realizations of spatially correlated percolation models. The schemes are shown to be efficient in complementary regimes of correlation phase space. They are combined with a generalized Newman-Ziff…
I calculated the exact site and bond percolation probability on lattice-like graphs for given dimension d: site percolation probability is 1/d and bond percolation probability is 0.5(d-1)^{-1/2}
In this article, we investigate both site and bond percolation on a weighted planar stochastic lattice (WPSL) which is a multi-multifractal and whose dual is a scale-free network. The characteristic properties of percolation is that it…
We investigate the formation of an infinite cluster of entangled threads in a (2+1)-dimensional system. We demonstrate that topological percolation belongs to the universality class of the standard 2D bond percolation. We compute the…
We have derived long series expansions of the percolation probability for site, bond and site-bond percolation on the directed triangular lattice. For the bond problem we have extended the series from order 12 to 51 and for the site problem…
We study bond percolation on several four-dimensional (4D) lattices, including the simple (hyper) cubic (SC), the SC with combinations of nearest neighbors and second nearest neighbors (SC-NN+2NN), the body-centered cubic (BCC), and the…