Related papers: Percolation in the marked stationary Random Connec…
Correlations are known to play a crucial role in determining the structure of complex networks. Here we study how their presence affects the computation of the percolation threshold in random hypergraphs. In order to mimic the correlation…
In this paper, we study a model of long-range site percolation on graphs of bounded degree, namely the Boolean percolation model. In this model, each vertex of an infinite connected graph is the center of a ball of random radius, and…
Percolation on complex networks is used both as a model for dynamics on networks, such as network robustness or epidemic spreading, and as a benchmark for our models of networks, where our ability to predict percolation measures our ability…
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…
Percolation on networks is a common framework to model a wide range of processes, from cascading failures to epidemic spreading. Standard percolation assumes short-range interactions, implying that nodes can merge into clusters only if they…
Simplicial complexes are gaining increasing scientific attention as they are generalized network structures that can represent the many-body interactions existing in complex systems raging from the brain to high-order social networks.…
We report the discovery of a discrete hierarchy of micro-transitions occurring in models of continuous and discontinuous percolation. The precursory micro-transitions allow us to target almost deterministically the location of the…
During the past two decades, percolation has long served as a basic paradigm for network resilience, community formation and so on in complex systems. While the percolation transition is known as one of the most robust continuous…
We establish the sharpness of the percolation phase transition for a class of infinite-range weighted random connection models. The vertex set is given by a marked Poisson point process on $\mathbb{R}^d$ with intensity $\lambda>0$, where…
Let $G=G(d)$ be a random graph with a given degree sequence $d$, such as a random $r$-regular graph where $r\ge 3$ is fixed and $n=|G|\to\infty$. We study the percolation phase transition on such graphs $G$, i.e., the emergence as $p$…
We consider connectivity properties of certain i.i.d. random environments on $\Z^d$, where at each location some steps may not be available. Site percolation and oriented percolation can be viewed as special cases of the models we consider.…
The function of a real network depends not only on the reliability of its own components, but is affected also by the simultaneous operation of other real networks coupled with it. Robustness of systems composed of interdependent network…
We present a comprehensive and versatile theoretical framework to study site and bond percolation on clustered and correlated random graphs. Our contribution can be summarized in three main points. (i) We introduce a set of iterative…
Given a weighted graph, we introduce a partition of its vertex set such that the distance between any two clusters is bounded from below by a power of the minimum weight of both clusters. This partition is obtained by recursively merging…
Simplicial complexes are increasingly used to understand the topology of complex systems as different as brain networks and social interactions. It is therefore of special interest to extend the study of percolation to simplicial complexes.…
Percolation and synchronization are two phase transitions that have been extensively studied since already long ago. A classic result is that, in the vast majority of cases, these transitions are of the second-order type, i.e. continuous…
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…
We study site and bond percolation on directed simple random graphs with a given degree distribution and derive the expressions for the critical value of the percolation probability above which the giant strongly connected component emerges…
Here we prove critical exponents for Random Connections Models (RCMs) with random marks. The vertices are given by a marked Poisson point process on $\mathbb{R}^d$ and an edge exists between any pair of vertices independently with a…
We consider bond percolation on random graphs with given degrees and bounded average degree. In particular, we consider the order of the largest component after the random deletion of the edges of such a random graph. We give a rough…