Related papers: Transport collapse in dynamically evolving network…
Scale-free and non-computable characteristics of natural networks are found to result from the least-time dispersal of energy. To consider a network as a thermodynamic system is motivated since ultimately everything that exists can be…
We study the mutual percolation of a system composed of two interdependent random regular networks. We introduce a notion of distance to explore the effects of the proximity of interdependent nodes on the cascade of failures after an…
A large number of complex networks, both natural and artificial, share the presence of highly heterogeneous, scale-free degree distributions. A few mechanisms for the emergence of such patterns have been suggested, optimization not being…
We find that transport on scale-free random networks depends strongly on degree-correlated network topologies whereas transport on Erd$\ddot{o}$s-R$\acute{e}$nyi networks is insensitive to the degree correlation. An approach for the tuning…
We study tolerance and topology of random scale-free networks under attack and defense strategies that depend on the degree k of the nodes. This situation occurs, for example, when the robustness of a node depends on its degree or in an…
Large but rare cascades triggered by small initial shocks are present in most of the infrastructure networks. Here we present a simple model for cascading failures based on the dynamical redistribution of the flow on the network. We show…
Following up on a previous work we examine a model of transportation network in some source-sink flow paradigm subjected to growth and resource allocation. The model is inspired from plants, and we add rules and factors that are analogous…
To study transport properties of complex networks, we analyze the equivalent conductance $G$ between two arbitrarily chosen nodes of random scale-free networks with degree distribution $P(k)\sim k^{-\lambda}$ in which each link has the same…
We consider the role of network geometry in two types of diffusion processes: transport of constant-density information packets with queuing on nodes, and constant voltage-driven tunneling of electrons. The underlying network is a…
We present analytic and numeric results for percolation in a network formed of interdependent spatially embedded networks. We show results for a treelike and a random regular network of networks each with $(i)$ unconstrained interdependent…
The combination of the compactness of networks, featuring small diameters, and their complex architectures results in a variety of critical effects dramatically different from those in cooperative systems on lattices. In the last few years,…
Complex systems are large collections of entities that organize themselves into non-trivial structures that can be represented by networks. A key emergent property of such systems is robustness against random failures or targeted attacks…
We study transportation networks controlled by dynamical feedback tolls. We consider a multiscale transportation network model whereby the dynamics of the traffic flows are intertwined with those of the drivers' route choices. The latter…
The interplay between time scales and structural properties of complex networks of nonlinear oscillators can generate many interesting phenomena, like amplitude death, cluster synchronization, frequency synchronization etc. We study the…
Scale-free networks constitute a fast-developing field that has already provided us with important tools to understand natural and social phenomena. From biological systems to environmental modifications, from quantum fields to high energy…
The central points of communication network flow has often been identified using graph theoretical centrality measures. In real networks, the state of traffic density arises from an interplay between the dynamics of the flow and the…
We investigate the effects of link deletion on a 1 - to - 1 transmission process occurring on various models of directed networks and characterize them in terms of the fraction of successful transmissions and average transmission time. We…
Distributions of the resilience of transport networks are studied numerically, in particular the large-deviation tails. Thus, not only typical quantities like average or variance but the distributions over the (almost) full support can be…
In considering a social network, there are cases where people is transferred to another place. Then the physical (direct) relations among nodes are lost by the movement. In terms of a network theory, some nodes break the present connections…
As a function of connectivity, spring networks exhibit a critical transition between floppy and rigid phases at an isostatic threshold. For connectivity below this threshold, fiber networks were recently shown theoretically to exhibit a…