Related papers: Nearest-neighbor connectedness theory: A general a…
We use a previously introduced mapping between the continuum percolation model and the Potts fluid (a system of interacting s-states spins which are free to move in the continuum) to derive the low density expansion of the pair…
We consider density estimators based on the nearest neighbors method applied to discrete point distibutions in spaces of arbitrary dimensionality. If the density is constant, the volume of a hypersphere centered at a random location is…
In the paper random-site percolation thresholds for simple cubic lattice with sites' neighborhoods containing next-next-next-nearest neighbors (4NN) are evaluated with Monte Carlo simulations. A recently proposed algorithm with low sampling…
The asymptotic behavior of the percolation threshold $p_c$ and its dependence upon coordination number $z$ is investigated for both site and bond percolation on four-dimensional lattices with compact extended neighborhoods. Simple…
In this work we apply a highly efficient Monte Carlo algorithm recently proposed by Newman and Ziff to treat percolation problems. The site and bond percolation are studied on a number of lattices in two and three dimensions. Quite good…
The methods of conformal field theory are used to compute the crossing probabilities between segments of the boundary of a compact two-dimensional region at the percolation threshold. These probabilities are shown to be invariant not only…
Using computer simulations, we have studied the percolation and the electrical conductance of two-dimensional, random percolating networks of curved, zero-width metallic nanowires. We mimicked the curved nanowires using circular arcs. The…
We investigate the influence of the range of interactions in the two-dimensional bond percolation model, by means of Monte Carlo simulations. We locate the phase transitions for several interaction ranges, as expressed by the number $z$ of…
We propose an approach to calculate the critical percolation threshold for finite-sized Erdos-Renyi digraphs using minimal Hamiltonian cycles. We obtain an analytically exact result, valid non-asymptotically for all graph sizes, which…
We present a Monte Carlo study of the bond and site directed (oriented) percolation models in $(d+1)$ dimensions on simple-cubic and body-centered-cubic lattices, with $2 \leq d \leq 7$. A dimensionless ratio is defined, and an analysis of…
A general method is proposed for predicting the asymptotic percolation threshold of networks with bottlenecks, in the limit that the sub-net mesh size goes to zero. The validity of this method is tested for bond percolation on filled…
We study $N$-cluster correlation functions in four- and five-dimensional (4D, 5D) bond percolation by extensive Monte Carlo simulation. We reformulate the transfer Monte Carlo algorithm for percolation [Phys. Rev. E {\bf 72}, 016126 (2005)]…
We estimate locations of the regions of the percolation and of the non-percolation in the plane $(\lambda,\beta)$: the Poisson rate -- the inverse temperature, for interacted particle systems in finite dimension Euclidean spaces. Our…
Global physical properties of random media change qualitatively at a percolation threshold, where isolated clusters merge to form one infinite connected component. The precise knowledge of percolation thresholds is thus of paramount…
The statistical analysis of cosmic large-scale structure is most often based on simple two-point summary statistics, like the power spectrum or the two-point correlation function of a sample of galaxies or other types of tracers. In…
During the last few years, a number of works in computer simulation have focused on the clustering and percolation properties of simple fluids based in an energetic connectivity criterion proposed long ago by T.L. Hill [J. Chem. Phys. 23,…
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…
Theoretical attempts proposed so far to describe ordinary percolation processes on real-world networks rely on the locally tree-like ansatz. Such an approximation, however, holds only to a limited extent, as real graphs are often…
These lectures give an introduction to the methods of conformal field theory as applied to deriving certain results in two-dimensional critical percolation: namely the probability that there exists at least one cluster connecting two…
Statistical evidence of the influence of neighborhood topology on the performance of particle swarm optimization (PSO) algorithms has been shown in many works. However, little has been done about the implications could have the percolation…