Related papers: Assessing Percolation Threshold Based on High-Orde…
Percolation theory characterizing the robustness of a network has applications ranging from biology, to epidemic spreading, and complex infrastructures. Percolation theory, however, only concern the typical response of a infinite network to…
Fractal percolation has been introduced by Mandelbrot in 1974. We study the two-dimensional case, with integer subdivision index M and survival probability p. It is well known that there exists a non-trivial critical value p_c(M) such that…
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…
In bootstrap percolation it is known that the critical percolation threshold tends to converge slowly to zero with increasing system size, or, inversely, the critical size diverges fast when the percolation probability goes to zero. To…
Modeling how networks change under structural perturbations can yield foundational insights into network robustness, which is critical in many real-world applications. The largest connected component is a popular measure of network…
Percolation, the formation of a macroscopic connected component, is a key feature in the description of complex networks. The dynamical properties of a variety of systems can be understood in terms of percolation, including the robustness…
In this work we present PercIS, an algorithm based on Importance Sampling to approximate the percolation centrality of all the nodes of a graph. Percolation centrality is a generalization of betweenness centrality to attributed graphs, and…
We provide a simple proof that graphs in a general class of self-similar networks have zero percolation threshold. The considered self-similar networks include random scale-free graphs with given expected node degrees and zero clustering,…
A wireless communication network is considered where any two nodes are connected if the signal-to-interference ratio (SIR) between them is greater than a threshold. We consider the the path-loss plus fading model of wireless signal…
A concept of higher order neighborhood in complex networks, introduced previously (PRE \textbf{73}, 046101, (2006)), is systematically explored to investigate larger scale structures in complex networks. The basic idea is to consider each…
Whether comparing networks to each other or to random expectation, measuring dissimilarity is essential to understanding the complex phenomena under study. However, determining the structural dissimilarity between networks is an ill-defined…
The existence or not of a percolation threshold on power law correlated graphs is a fundamental question for which a general criterion is lacking. In this work we investigate the problems of site and bond percolation on graphs with degree…
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…
While classical percolation is well understood, percolation effects in randomly packed or jammed structures are much less explored. Here we investigate both experimentally and theoretically the electrical percolation in a binary composite…
The properties of polymer composites with nanofiller particles change drastically above a critical filler density known as the percolation threshold. Real nanofillers, such as graphene flakes and cellulose nanocrystals, are not idealized…
Analytical approaches to model the structure of complex networks can be distinguished into two groups according to whether they consider an intensive (e.g., fixed degree sequence and random otherwise) or an extensive (e.g., adjacency…
Network alignment consists of finding a structure-preserving correspondence between the nodes of two correlated, but not necessarily identical, networks. This problem finds applications in a wide variety of fields, from the alignment of…
We propose a novel finite size scaling analysis for percolation transition observed in complex networks. While it is known that cooperative systems in growing networks often undergo an infinite order transition with inverted…
We give a characterization of the percolation threshold for a multirange model on oriented trees, as the first positive root of a polynomial, with the use of a multi-type Galton-Watson process. This gives in particular the exact value of…
We propose a numerical method to evaluate the upper critical dimension $d_c$ of random percolation clusters in Erd\H{o}s-R\'{e}nyi networks and in scale-free networks with degree distribution ${\cal P}(k) \sim k^{-\lambda}$, where $k$ is…