Related papers: A percolation system with extremely long range con…
Survival and percolation probabilities are most important quantities in the theory and in the application of growth models with spreading. We construct field theoretical expressions for these probabilities which are feasible for…
We present a scaling hypothesis for the distribution function of the shortest paths connecting any two points on a percolating cluster which accounts for {\it (i)} the effect of the finite size of the system, and {\it (ii)} the dependence…
We apply connectedness percolation theory to fractal liquids of hard particles, and make use of a Percus-Yevick liquid state theory combined with a geometric connectivity criterion. We find that in fractal dimensions the percolation…
We study models of correlated percolation where there are constraints on the occupation of sites that mimic force-balance, i.e. for a site to be stable requires occupied neighboring sites in all four compass directions in two dimensions. We…
We propose a statistical model defined on the three-dimensional diamond network where the splitting of randomly selected nodes leads to a spatially disordered network, with decreasing degree of connectivity. The terminal state, that is…
We numerically study the structure of the interactions occurring in three-dimensional systems of hard spheres at jamming, focusing on the large-scale behavior. Given the fundamental role they play in the configuration of jammed packings, we…
We analyze the properties of Degree-Ordered Percolation (DOP), a model in which the nodes of a network are occupied in degree-descending order. This rule is the opposite of the much studied degree-ascending protocol, used to investigate…
We report some novel properties of a square lattice filled with white sites, randomly occupied by black sites (with probability $p$). We consider connections up to second nearest neighbours, according to the following rule. Edge-sharing…
Networks composed from both connectivity and dependency links were found to be more vulnerable compared to classical networks with only connectivity links. Their percolation transition is usually of a first order compared to the second…
The Harris-Aharony criterion for a statistical model predicts, that if a specific heat exponent $\alpha \ge 0$, then this model does not exhibit self-averaging. In two-dimensional percolation model the index $\alpha=-{1/2}$. It means that,…
We perform large-scale simulations of the two-dimensional long-range bond percolation model with algebraically decaying percolation probabilities $\sim 1/r^{2+\sigma}$, using both conventional ensemble and event-based ensemble methods for…
Many real-world networks exhibit the so-called small-world phenomenon: their typical distances are much smaller than their sizes. One mathematical model for this phenomenon is a long-range percolation graph on a $d$-dimensional box $\{0, 1,…
We present an analysis of the percolation transition for general node removal strategies valid for locally tree-like directed networks. On the basis of heuristic arguments we predict that, if the probability of removing node $i$ is $p_i$,…
We present an exact mathematical framework able to describe site-percolation transitions in real multiplex networks. Specifically, we consider the average percolation diagram valid over an infinite number of random configurations where…
In the last two decades, network science has blossomed and influenced various fields, such as statistical physics, computer science, biology and sociology, from the perspective of the heterogeneous interaction patterns of components…
The existence (or not) of infinite clusters is explored for two stochastic models of intersecting line segments in $d \ge 2$ dimensions. Salient features of the phase diagram are established in each case. The models are based on site…
In this paper we will consider the contact process in a very simple type of random environment that physicists call the random dilution model. We start with the contact process on a graph, here either $\mathbb{Z}^d$, a $d$-dimensional torus…
We present simulation results for the contact process on regular, cubic networks that are composed of a one-dimensional lattice and a set of long edges with unbounded length. Networks with different sets of long edges are considered, that…
Several results are presented for site percolation on quasi-transitive, planar graphs $G$ with one end, when properly embedded in either the Euclidean or hyperbolic plane. If $(G_1,G_2)$ is a matching pair derived from some quasi-transitive…
This paper exhibits a Monte Carlo study on site percolation using the Newmann-Ziff algorithm in distorted square and simple cubic lattices where each site is allowed to be directly linked with any other site if the euclidean separation…