Related papers: Power-law Strength-Degree Correlation From a Resou…
We study the performance of Weibull and scale free Internet-like networks and compare them to a classical random graph based network. The scaling of the traffic load with the nodal degree is established, and confimed in a numerical…
The vast majority of real-world networks are scale-free, loopy, and sparse, with a power-law degree distribution and a constant average degree. In this paper, we study first-order consensus dynamics in binary scale-free networks, where…
Scale-free networks arise from power-law degree distributions. Due to the finite size of real-world networks, the power law inevitably has a cutoff at some maximum degree $\Delta$. We investigate the relative size of the giant component $S$…
We model information traffic on scale-free networks by introducing the bandwidth as the delivering ability of links. We focus on the effects of bandwidth on the packet delivering ability of the traffic system to better understand traffic…
We investigate the percentage of delivering capacities that are actually consumed in a typical traffic dynamics where the capacities are uniformly assigned over a scale-free network. Theoretical analysis, as well as simulations, reveal that…
Complex systems contain a lot of individuals and some interactions between them. The structure of interactions can be modeled to be a network: nodes represent individuals and links to be interaction between two individuals. This paper tries…
We explore the relation between the topological relevance of a node in a complex network and the individual dynamics it exhibits. When the system is weakly coupled, the effect of the coupling strength against the dynamical complexity of the…
Introduced recently, the concept of hierarchical degree allows a more complete characterization of the topological context of a node in a complex network than the traditional node degree. This article presents analytical characterization…
The response of degree-correlated scale-free attractor networks to stimuli is studied. We show that degree-correlated scale-free networks are robust to random stimuli as well as the uncorrelated scale-free networks, while assortative…
We propose a model for the growth of weighted networks that couples the establishment of new edges and vertices and the weights' dynamical evolution. The model is based on a simple weight-driven dynamics and generates networks exhibiting…
Cellular metabolic networks exhibit scale-free topologies with power-law degree distributions across diverse organisms. Although such topologies are often linked to mutational robustness and evolutionary advantage, their role in metabolic…
Complex networks have been studied extensively due to their relevance to many real systems as diverse as the World-Wide-Web (WWW), the Internet, energy landscapes, biological and social networks…
We propose a natural model of evolving weighted networks in which new links are not necessarily connected to new nodes. The model allows a newly added link to connect directly two nodes already present in the network. This is plausible in…
We consider a recently introduced generalization of the Ising model in which individual spin strength can vary. The model is intended for analysis of ordering in systems comprising agents which, although matching in their binarity (i.e.,…
We study the detailed epidemic spreading process in scale-free networks with weight that denote familiarity between two people or computers. The result shows that spreading velocity reaches a peak quickly then decays representing power-law…
Scale-free (SF) networks and small world networks have been found to occur in very diverse contexts. It is this striking universality which makes one look for widely applicable mechanisms which lead to the formation of such networks. In…
A power law degree distribution is established for a graph evolution model based on the graph class of k-trees. This k-tree-based graph process can be viewed as an idealized model that captures some characteristics of the preferential…
We propose a model of random diffusion to investigate flow fluctuations in complex networks. We derive an analytical law showing that the dependence of fluctuations with the mean traffic in a network is ruled by the delicate interplay of…
Power law is one of the the simplest forms of the relationship between different variables of a system. It leads naturally to the introduction of compound parameters describing physical properties of the system. Often one of the variables…
In this paper we provide numerical evidence of the richer behavior of the connectivity degrees in heterogeneous preferential attachment networks in comparison to their homogeneous counterparts. We analyze the degree distribution in the…