Related papers: Bond percolation in distorted square and triangula…
Three-dimensional bond or site percolation theory on a lattice can be interpreted as a gauge theory in which the Wilson loops are viewed as counters of topological linking with random clusters. Beyond the percolation threshold large Wilson…
In this paper, the 60-year-old concept of long-range interaction in percolation problems introduced by Dalton, Domb, and Sykes, is reconsidered. With Monte Carlo simulation -- based on Newman-Ziff algorithm and finite-size scaling…
We present an analytical approach for bond percolation on multiplex networks and use it to determine the expected size of the giant connected component and the value of the critical bond occupation probability in these networks. We advocate…
We consider bond percolation on high-dimensional product graphs $G=\square_{i=1}^tG^{(i)}$, where $\square$ denotes the Cartesian product. We call the $G^{(i)}$ the base graphs and the product graph $G$ the host graph. Very recently, Lichev…
Percolation in complex networks is viewed as both: a process that mimics network degradation and a tool that reveals peculiarities of the underlying network structure. During the course of percolation, networks undergo non-trivial…
A new position-space renormalization group approach is investigated for bond directed percolation in two dimensions. The threshold value for the bond occupation probabilities is found to be $p_c=0.6443$. Correlation length exponents on time…
In Poisson percolation each edge becomes open after an independent exponentially distributed time with rate that decreases in the distance from the origin. As a sequel to our work on the square lattice, we describe the limiting shape of the…
In diluted lattices, cooperation is often enhanced at specific densities, particularly near the percolation threshold for stochastic updating rules. However, the Replicator rule, despite being probabilistic, does not follow this trend. We…
We study mixed site-bond directed percolation on 2D and 3D lattices by using time-dependent simulations. Our results are compared with rigorous bounds recently obtained by Liggett and by Katori and Tsukahara. The critical fractions…
The Hamming graph $H(d,n)$ is the Cartesian product of $d$ complete graphs on $n$ vertices. Let $m=d(n-1)$ be the degree and $V = n^d$ be the number of vertices of $H(d,n)$. Let $p_c^{(d)}$ be the critical point for bond percolation on…
It is shown that different ways of interacting strings formed in high energy nucleus-nucleus collisions cause a different strength of the chaoticity parameter lambda of Bose-Einstein correlations. In particular, in the case of percolation…
We present a general method for predicting bond percolation thresholds and critical surfaces for a broad class of two-dimensional periodic lattices, reproducing many known exact results and providing excellent approximations for several…
We study percolation problems of overlapping objects where the underlying geometry is such that in D-dimensions, a subset of the directions has a lattice structure, while the remaining directions have a continuum structure. The resulting…
Delaunay protection is a measure of how far a Delaunay triangulation is from being degenerate. In this short paper we study the protection properties and other quality measures of the Delaunay triangulations of a family of lattices that is…
The self averaging properties of conductance $g$ are explored in random resistor networks with a broad distribution of bond strengths $P(g)\simg^{\mu-1}$. Distributions of equivalent conductances are estimated numerically on hierarchical…
Bootstrap percolation on a graph is a deterministic process that iteratively enlarges a set of occupied sites by adjoining points with at least $\theta$ occupied neighbors. The initially occupied set is random, given by a uniform product…
We prove that enhanced entanglement percolation via lattice transformation is possible even if the new lattice is more poorly connected in that: i) the coordination number (a local property) decreases, or ii) the classical percolation…
In r-neighbour bootstrap percolation on a graph G, a set of initially infected vertices A \subset V(G) is chosen independently at random, with density p, and new vertices are subsequently infected if they have at least r infected…
Experiments have evidenced proton pairing in Y-doped BaZrO3. However, the nature of proton pairing and its impact on conduction remain insufficiently understood theoretically. Here, through quantitative computational analysis of…
Two surfaces are "sticky" if breaking their mutual contact requires a finite tensile force. At low fractal dimensions D, there is consensus stickiness does not depend on the upper truncation frequency of roughness spectrum (or…