Related papers: Positive association and global connectivity in de…
The social percolation model \citep{solomon-et-00} considers a 2-dimensional regular lattice. Each site is occupied by an agent with a preference $x_{i}$ sampled from a uniform distribution $U[0,1]$. Agents transfer the information about…
Lattices that can be represented in a kagome-like form are shown to satisfy a universal percolation criticality condition, expressed as a relation between P_3, the probability that all three vertices in the triangle connect, and P_0, the…
When real networks are considered, coupled networks with connectivity and feedback-dependency links are not rare but more general. Here we develop a mathematical framework and study numerically and analytically percolation of interacting…
We use very efficient algorithms to calculate low-density series for bond and site percolation on the directed triangular, honeycomb, kagom\'e, and $(4.8^2)$ lattices. Analysis of the series yields accurate estimates of the critical point…
We consider a family of percolation models in which geometry and connectivity are defined by two independent random processes. Such models merge characteristics of discrete and continuous percolation. We develop an algorithm allowing…
Two vertices are said to be finitely connected if they belong to the same cluster and this cluster is finite. We derive sharp asymptotics for finite connection probabilities for supercritical Bernoulli bond percolation on Z^2.
The frequency dependence of the dielectric loss angle for a metal-insulator composite was shown previously to be an efficient method to experimentally determine the percolation threshold. The statistical properties of this angle are found…
We consider a class of random, weighted networks, obtained through a redefinition of patterns in an Hopfield-like model and, by performing percolation processes, we get information about topology and resilience properties of the networks…
In site percolation, vertices (sites) of a graph are open with probability p, and there is critical p, for which open vertices form an open path the long way across a graph, so a vertex at the origin is a part of an infinite connected open…
We compare phase transition and critical phenomena of bond percolation on Euclidean lattices, nonamenable graphs, and complex networks. On a Euclidean lattice, percolation shows a phase transition between the nonpercolating phase and…
We use a new algorithm to find the stress-carrying backbone of ``generic'' site-diluted triangular lattices of up to 10^6 sites. Generic lattices can be made by randomly displacing the sites of a regular lattice. The percolation threshold…
Motivated by the importance of geometric information in real systems, a new model for long-range correlated percolation in link-adding networks is proposed with the connecting probability decaying with a power-law of the distance on the…
We study the history-dependent percolation in two dimensions, which evolves in generations from standard bond-percolation configurations through iteratively removing occupied bonds. Extensive simulations are performed for various…
We obtain the critical threshold for a host of Potts and percolation models on lattices having a structure which permits a duality consideration. The consideration generalizes the recently obtained thresholds of Scullard and Ziff for bond…
We consider independent long-range percolation models on locally finite vertex-transitive graphs. Using coupling ideas we prove strict monotonicity of the critical points with respect to local perturbations in the connection function,…
We introduce and study a family of 2D percolation systems which are based on the bond percolation model of the triangular lattice. The system under study has local correlations, however, bonds separated by a few lattice spacings act…
We present high statistics data on the distribution of shortest path lengths between two near-by points on the same cluster at the percolation threshold. Our data are based on a new and very efficient algorithm. For $d=2$ they clearly…
We study a lattice model where the coupling stochastically switches between repulsive (subtractive) and attractive (additive) at each site with probability p at every time instance. We observe that such kind of coupling stabilizes the local…
We study how to restore site percolation on a damaged square lattice with nearest neighbor (N$^2$) interactions. Two strategies are suggested for a density $x$ of destroyed sites by a random attack at $p_c$. In the first one, a density $y$…
We study percolation on the hierarchical lattice of order $N$ where the probability of connection between two points separated by distance $k$ is of the form $c_k/N^{k(1+\delta)},\; \delta >-1$. Since the distance is an ultrametric, there…