Related papers: Core percolation on complex networks
A model of correlated random networks is examined, i.e. networks with correlations between the degrees of neighboring nodes. These nodes do not necessarily have to be direct neighbors, the maximum range of the correlations can be…
In this paper, we investigate the effect of local structures on network processes. We investigate a random graph model that incorporates local clique structures to deviate from the locally tree-like behavior of most standard random graph…
We study percolation on networks, which is used as a model of the resilience of networked systems such as the Internet to attack or failure and as a simple model of the spread of disease over human contact networks. We reformulate…
We address the problem of social network de-anonymization when relationships between people are described by scale-free graphs. In particular, we propose a rigorous, asymptotic mathematical analysis of the network de-anonymization problem…
The type of malicious attack inflicting on networks greatly influences their stability under ordinary percolation in which a node fails when it becomes disconnected from the giant component. Here we study its generalization, $k$-core…
We consider propagation models that describe the spreading of an attribute, called "damage", through the nodes of a random network. In some systems, the average fraction of nodes that remain undamaged vanishes in the large system limit, a…
We study the statistical behavior under random sequential renormalization(RSR) of several network models including Erd"os R'enyi (ER) graphs, scale-free networks and an annealed model (AM) related to ER graphs. In RSR the network is locally…
While studies of meso-scale structures in networks often focus on community structure, core--periphery structures can reveal new insights. This structure typically consists of a well-connected core and a periphery that is well connected to…
We analyze critical phenomena on networks generated as the union of hidden variables models (networks with any desired degree sequence) with arbitrary graphs. The resulting networks are general small-worlds similar to those a` la Watts and…
Cascading failures in complex systems have been studied extensively using two different models: $k$-core percolation and interdependent networks. We combine the two models into a general model, solve it analytically and validate our…
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…
Explosive percolation in a network is a phase transition where a large portion of nodes becomes connected with an addition of a small number of edges. Although extensively studied in random network models and reconstructed real networks,…
We derive mean-field equations that describe the dynamics of a general model of rumor spreading on complex networks, and use analytical and numerical solutions of these equations to examine the threshold behavior and dynamics of the model…
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 network with core-periphery structure consists of core nodes that are densely interconnected. In contrast to community structure, which is a different meso-scale structure of networks, core nodes can be connected to peripheral nodes and…
Percolation in an information-theoretically secure graph is considered where both the legitimate and the eavesdropper nodes are distributed as Poisson point processes. For both the path-loss and the path-loss plus fading model, upper and…
Analysis of degree-degree dependencies in complex networks, and their impact on processes on networks requires null models, i.e. models that generate uncorrelated scale-free networks. Most models to date however show structural negative…
The resilience of a complex interconnected system concerns the size of the macroscopic functioning node clusters after external perturbations based on a random or designed scheme. For a representation of the interconnected systems with…
We investigate the degree distribution $P(k)$ and the clustering coefficient $C$ of the line graphs constructed on the Erd\"os-R\'enyi networks, the exponential and the scale-free growing networks. We show that the character of the degree…
In this paper, we study the order of the largest connected component of a random graph having two sources of randomness: first, the graph is chosen randomly from all graphs with a given degree sequence, and then bond percolation is applied.…