Related papers: Heterogeneous micro-structure of percolation in sp…
We propose the $K$-selective percolation process as a model for the iterative removals of nodes with the specific intermediate degree in complex networks. In the model, a random node with degree $K$ is deactivated one by one until no more…
In complex networks the degrees of adjacent nodes may often appear dependent -- which presents a modelling challenge. We present a working framework for studying networks with an arbitrary joint distribution for the degrees of adjacent…
Higher order interactions are increasingly recognised as a fundamental aspect of complex systems ranging from the brain to social contact networks. Hypergraph as well as simplicial complexes capture the higher-order interactions of complex…
Analytical description of propagation phenomena on random networks has flourished in recent years, yet more complex systems have mainly been studied through numerical means. In this paper, a mean-field description is used to coherently…
We review and introduce a generalized reaction-diffusion approach to epidemic spreading in a metapopulation modeled as a complex network. The metapopulation consists of susceptible and infected individuals that are grouped in subpopulations…
In recent years, many variants of percolation have been used to study network structure and the behavior of processes spreading on networks. These include bond percolation, site percolation, $k$-core percolation, bootstrap percolation, the…
Hypergraphs capture the higher-order interactions in complex systems and always admit a factor graph representation, consisting of a bipartite network of nodes and hyperedges. As hypegraphs are ubiquitous, investigating hypergraph…
A probabilistic framework is introduced that represents stylized banking networks and aims to predict the size of contagion events. In contrast to previous work on random financial networks, which assumes independent connections between…
Recently much attention has been paid to the study of the robustness of interdependent and multiplex networks and, in particular, networks of networks. The robustness of interdependent networks can be evaluated by the size of a mutually…
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…
We study expanding circle maps interacting in a heterogeneous random network. Heterogeneity means that some nodes in the network are massively connected, while the remaining nodes are only poorly connected. We provide a probabilistic…
In this work, we present a new algorithm to approximate the percolation centrality of every node in a graph. Such a centrality measure quantifies the importance of the vertices in a network during a contagious process. In this paper, we…
Many biological tissues feature a heterogeneous network of fibers whose tensile and bending rigidity contribute substantially to these tissues' elastic properties. Rigidity percolation has emerged as a important paradigm for relating these…
We propose an approach to calculate the critical percolation threshold for finite-sized Erdos-Renyi digraphs using minimal Hamiltonian cycles. We obtain an analytically exact result, valid non-asymptotically for all graph sizes, which…
We propose and investigate a unifying class of sparse random graph models, based on a hidden coloring of edge-vertex incidences, extending an existing approach, Random graphs with a given degree distribution, in a way that admits a…
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. Assuming that the nodes of the wireless network are distributed as a…
The concept of 'complexity' plays a central role in complex network science. Traditionally, this term has been taken to express heterogeneity of the node degrees of a therefore complex network. However, given that the degree distribution is…
We apply percolation theory to a recently proposed measure of fragmentation $F$ for social networks. The measure $F$ is defined as the ratio between the number of pairs of nodes that are not connected in the fragmented network after…
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…
A key task in the study of networked systems is to derive local and global properties that impact connectivity, synchronizability, and robustness; computing shortest paths or geodesics yields measures of network connectivity that can…