Related papers: Structures in supercritical scale-free percolation
We introduce a simple lattice model in which percolation is constructed on top of critical percolation clusters, and show that it can be repeated recursively any number $n$ of generations. In two dimensions, we determine the percolation…
We study limits of the largest connected components (viewed as metric spaces) obtained by critical percolation on uniformly chosen graphs and configuration models with heavy-tailed degrees. For rank-one inhomogeneous random graphs, such…
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…
Classical percolation theory underlies many processes of information transfer along the links of a network. In these standard situations, the requirement for two nodes to be able to communicate is the presence of at least one uninterrupted…
Although well described by mean-field theory in the thermodynamic limit, scaling has long been puzzling for finite systems in high dimensions. This raised questions about the efficacy of the renormalization group and foundational concepts…
We consider vertex percolation on pseudo-random $d-$regular graphs. The previous study by the second author established the existence of phase transition from small components to a linear (in $\frac{n}{d}$) sized component, at…
Complex networks display various types of percolation transitions. We show that the degree distribution and the degree-degree correlation alone are not sufficient to describe diverse percolation critical phenomena. This suggests that a…
Percolation is a model for random damage to a network. It is one of the simplest models that displays a phase transition: when the network is severely damaged, it falls apart in many small connected components, while if the damage is light,…
We analytically explore the scaling properties of a general class of nested subgraphs in complex networks, which includes the $K$-core and the $K$-scaffold, among others. We name such class of subgraphs $K$-nested subgraphs due to the fact…
We propose a deterministic weighted scale-free small-world model for considering pseudofractal web with the coevolution of topology and weight. In the model, we have the degree distribution exponent $\gamma$ restricted to a range between 2…
In this paper, we present a simple model of scale-free networks that incorporates both preferential & random attachment and anti-preferential & random deletion at each time step. We derive the degree distribution analytically and show that…
In a recursive way and by including a parameter, we introduce a family of deterministic scale-free networks. The resulting networks exhibit small-world effects. We calculate the exact results for the degree exponent, the clustering…
A central claim in modern network science is that real-world networks are typically "scale free," meaning that the fraction of nodes with degree $k$ follows a power law, decaying like $k^{-\alpha}$, often with $2 < \alpha < 3$. However,…
We prove absence of infinite clusters and contours in a class of critical constrained percolation models on the square lattice. The percolation configuration is assumed to satisfy certain hard local constraints, but only weak symmetry and…
Assign to each vertex of the one-dimensional torus i.i.d. weights with a heavy-tail of index $\tau-1>0$. Connect then each couple of vertices with probability roughly proportional to the product of their weights and that decays polynomially…
In this paper, we prove that Bernoulli percolation on bounded degree graphs with isoperimetric dimension $d>4$ undergoes a non-trivial phase transition (in the sense that $p_c<1$). As a corollary, we obtain that the critical point of…
We analyze the critical connectivity of systems of penetrable $d$-dimensional spheres having size distributions in terms of weighed random geometrical graphs, in which vertex coordinates correspond to random positions of the sphere centers…
The finite-size scaling behaviour for percolation and conduction is studied in two-dimensional triangular-shaped random resistor networks at the percolation threshold. The numerical simulations are performed using an efficient star-triangle…
Recently the problem of classes of vulnerable vertices (represented by colors) in complex networks has been discussed, where all vertices with the same vulnerability are prone to fail together. Utilizing redundant paths each avoiding one…
We propose a maximally disassortative (MD) network model which realizes a maximally negative degree-degree correlation, and study its percolation transition to discuss the effect of a strong degree-degree correlation on the percolation…