相关论文: Scale-free Networks from Optimal Design

Systems as diverse as genetic networks or the world wide web are best described as networks with complex topology. A common property of many large networks is that the vertex connectivities follow a scale-free power-law distribution. This…

We show how scale-free degree distributions can emerge naturally from growing networks by using random walks for selecting vertices for attachment. This result holds for several variants of the walk algorithm and for a wide range of…

Recently, one paper in Nature(Papadopoulos, 2012) raised an old debate on the origin of the scale-free property of complex networks, which focuses on whether the scale-free property origins from the optimization or not. Because the…

What is the underlying mechanism leading to power-law degree distributions of many natural and artificial networks is still at issue. We consider that scale-free networks emerges from self-organizing process, and such a evolving model is…

Scale-free networks are abundant in nature and society, describing such diverse systems as the world wide web, the web of human sexual contacts, or the chemical network of a cell. All models used to generate a scale-free topology are…

A large computer program is typically divided into many hundreds or even thousands of smaller units, whose logical connections define a network in a natural way. This network reflects the internal structure of the program, and defines the…

The concept of scale-free networks has been widely applied across natural and physical sciences. Many claims are made about the properties of these networks, even though the concept of scale-free is often vaguely defined. We present tools…

Recently there have been a tremendous interest in models of networks with a power-law distribution of degree -- so called "scale-free networks." It has been observed that such networks, normally, have extremely short path-lengths, scaling…

We consider the self organizing process of merging and regeneration of vertices in complex networks and demonstrate that a scale-free degree distribution emerges in a steady state of such a dynamics. The merging of neighbor vertices in a…

A central claim in modern network science is that real-world networks are typically "scale free," meaning that the fraction of nodes with degree $k$ follows a power law, decaying like $k^{-\alpha}$, often with $2 < \alpha < 3$. However,…

Many complex systems--from social and communication networks to biological networks and the Internet--are thought to exhibit scale-free structure. However, prevailing explanations rely on the constant addition of new nodes, an assumption…

Real-life networks often encounter vertex dysfunctions, which are usually followed by recoveries after appropriate maintenances. In this paper we present our research on a model of scale-free networks whose vertices are regularly removed…

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…

Contrary to many recent models of growing networks, we present a model with fixed number of nodes and links, where it is introduced a dynamics favoring the formation of links between nodes with degree of connectivity as different as…

Many complex systems can be described in terms of networks of interacting units. Recent studies have shown that a wide class of both natural and artificial nets display a surprisingly widespread feature: the presence of highly heterogeneous…

A variety of scale-free networks have been created since the pioneer work by A.-L. Barab\'{a}si and R. Albert. All this networks are homogeneous since they are composed of the same kind of nodes. In the realistic world, however, one element…

Growing networks have a causal structure. We show that the causality strongly influences the scaling and geometrical properties of the network. In particular the average distance between nodes is smaller for causal networks than for…

Heterogeneity in the degree distribution is known to suppress global synchronization in complex networks of symmetrically coupled oscillators. Scale-free networks display a great deal of heterogeneity, containing a few nodes, termed hubs,…

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 degree distribution's cut-off in finite size scale-free networks. We show that the cut-off behavior with the number of vertices $N$ is ruled by the topological constraints induced by the connectivity structure of the network.…