Related papers: Edge overload breakdown in evolving networks
In studying network growth, the conventional approach is to devise a growth mechanism, quantify the evolution of a statistic or distribution (such as the degree distribution), and then solve the equations in the steady state (the…
We propose a model for evolving networks by merging building blocks represented as complete graphs, reminiscent of modules in biological system or communities in sociology. The model shows power-law degree distributions, power-law…
We study a network formation game where agents receive benefits by forming connections to other agents but also incur both direct and indirect costs from the formed connections. Specifically, once the agents have purchased their…
Reliable functioning of supply and transport networks fundamentally support many non-equilibrium dynamical systems, from biological organisms and ecosystems to human-made water, gas, heat, electricity and traffic networks. Strengthening an…
We propose a simple model that aims at describing, in a stylized manner, how local breakdowns due unbalances or congestion propagate in real dynamical networks. The model converges to a self-organized critical stationary state in which the…
We consider a growing network, whose growth algorithm is based on the preferential attachment typical for scale-free constructions, but where the long-range bonds are disadvantaged. Thus, the probability to get connected to a site at…
In the understanding of important edges in complex networks, the edges with larger degree are naturally considered more important, and they will cause greater destructiveness when attacked. However, through simulation analysis, we conclude…
Taking into account the fact that overload failures in real-world functional networks are usually caused by extreme values of temporally fluctuating loads that exceed the allowable range, we study the robustness of scale-free networks…
This article addresses the degree distribution of subnetworks, namely the number of links between the nodes in each subnetwork and the remainder of the structure (cond-mat/0408076). The transformation from a subnetwork-partitioned model to…
We analyze the betweenness centrality (BC) of nodes in large complex networks. In general, the BC is increasing with connectivity as a power law with an exponent $\eta$. We find that for trees or networks with a small loop density $\eta=2$…
In recent years there has been considerable interest in the structure and dynamics of complex networks. One of the most studied networks is the linear Barab\'asi-Albert model. Here we investigate the nonlinear Barab\'asi-Albert growing…
We study the evolution of a random weighted network with complex nonlinear dynamics at each node, whose activity may cease as a result of interactions with other nodes. Starting from a knowledge of the micro-level behaviour at each node, we…
A version of ``preferential attachment'' random graphs, corresponding to linear ``weights'' with random ``edge additions,'' which generalizes some previously considered models, is studied. This graph model is embedded in a continuous-time…
A spatial scale-free network is introduced and studied whose motivation has been originated in the growing Internet as well as the Airport networks. We argue that in these real-world networks a new node necessarily selects one of its…
A model of an evolving network of interacting molecular species is shown to exhibit repeated rounds of crashes in which several species get rapidly depopulated, followed by recoveries. The network inevitably self-organizes into an…
Based on a theoretical model for opinion spreading on a network, through avalanches, the effect of external field is now considered, by using methods from non-equilibrium statistical mechanics. The original part contains the implementation…
Scaling behavior of scale-free evolving networks arising in communications, citations, collaborations, etc. areas is studied. We derive universal scaling relations describing properties of such networks and indicate limits of their…
Consensus strategies find a variety of applications in distributed coordination and decision making in multi-agent systems. In particular, average consensus plays a key role in a number of applications and is closely associated with two…
We propose a general framework for modelling network data that is designed to describe aspects of non-exchangeable networks. Conditional on latent (unobserved) variables, the edges of the network are generated by their finite growth history…
Edge computing promises to offer low-latency and ubiquitous computation to numerous devices at the network edge. For delay-sensitive applications, link delays can have a direct impact on service quality. These delays can fluctuate…