Related papers: Vertex overload breakdown in evolving networks
Although most networks in nature exhibit complex topology the origins of such complexity remains unclear. We introduce a model of a growing network of interacting agents in which each new agent's membership to the network is determined by…
Power grids, road maps, and river streams are examples of infrastructural networks which are highly vulnerable to external perturbations. An abrupt local change of load (voltage, traffic density, or water level) might propagate in a…
The Erdos-Renyi classical random graph is characterized by a fixed linking probability for all pairs of vertices. Here, this concept is generalized by drawing the linking probability from a certain distribution. Such a procedure is found to…
We study network traffic dynamics in a two dimensional communication network with regular nodes and hubs. If the network experiences heavy message traffic, congestion occurs due to finite capacity of the nodes. We discuss strategies to…
In recent decades, it has been emphasized that the evolving structure of networks may be shaped by interaction principles that yield sparse graphs with a vertex degree distribution exhibiting an algebraic tail, and other structural traits…
We study a supremacy distribution in evolving Barabasi-Albert networks. The supremacy $s_i$ of a node $i$ is defined as a total number of all nodes that are younger than $i$ and can be connected to it by a directed path. For a network with…
Recent studies on the evolutionary dynamics of the Prisoner's Dilemma game in scale-free networks have demonstrated that the heterogeneity of the network interconnections enhances the evolutionary success of cooperation. In this paper we…
In temporal networks, both the topology of the underlying network and the timings of interaction events can be crucial in determining how some dynamic process mediated by the network unfolds. We have explored the limiting case of the speed…
We investigate the contact process on scale-free networks evolving by a stationary dynamics whereby each vertex independently updates its connections with a rate depending on its power. This rate can be slowed down or speeded up by virtue…
An intuitive overview of the scalability of a variety of types of wireless networks is presented. Simple heuris- tic arguments are demonstrated here for scaling laws presented in other works, as well as for conditions not previously…
In this paper we present a network model to study the impact of spatial distribution of constituents, coupling between them and diffusive processes in the context of biological situations. The model is in terms of network of mobile elements…
Networked systems are susceptible to cascading failures, where the failure of an initial set of nodes propagates through the network, often leading to system-wide failures. In this work, we propose a multiplex flow network model to study…
Various kinds of spread of influence occur in real world social and virtual networks. These phenomena are formulated by activation processes and irreversible dynamic monopolies in combinatorial graphs representing the topology of the…
A complex network processing information or physical flows is usually characterized by a number of macroscopic quantities such as the diameter and the betweenness centrality. An issue of significant theoretical and practical interest is how…
We present a simple model of communication in networks with hierarchical branching. We analyze the behavior of the model from the viewpoint of critical systems under different situations. For certain values of the parameters, a continuous…
Real-world networks may exhibit detachment phenomenon determined by the cancelling of previously existing connections. We discuss a tractable extension of Yule model to account for this feature. Analytical results are derived and discussed…
The strength and stability properties of hierarchical load bearing networks and their strengthened variants have been discussed in recent work. Here, we study the avalanche time distributions on these load bearing networks. The avalanche…
Components in many real-world complex systems depend on each other for the resources required for survival, and may die of a shortage. These patterns of dependencies often take the form of a complex network whose structure potentially…
Pairwise network comparison is essential for various applications, including neuroscience, disease research, and dynamic network analysis. While existing literature primarily focuses on comparing entire network structures, we address a…
Complex networks have certain properties that distinguish them from their respective uniform or regular counterparts. One of these properties is the variation of topological properties along different hierarchical levels. In this work, we…