Related papers: Generating multi-scaling networks with different t…

The concept of network efficiency, recently proposed to characterize the properties of small-world networks, is here used to study the effects of errors and attacks on scale-free networks. Two different kinds of scale-free networks, i.e.…

Network growth is currently explained through mechanisms that rely on node prestige measures, such as degree or fitness. In many real networks those who create and connect nodes do not know the prestige values of existing nodes, but only…

Many complex natural and physical systems exhibit patterns of interconnection that conform, approximately, to a network structure referred to as scale-free. Preferential attachment is one of many algorithms that have been introduced to…

We study Erd\"{o}s-R\'enyi random graphs with random weights associated with each link. We generate a new ``Supernode network'' by merging all nodes connected by links having weights below the percolation threshold (percolation clusters)…

We introduce a new mechanism of connectivity evolution in networks to account for the emergence of scale-free behavior. The mechanism works on a fixed set of nodes and promotes growth from a minimally connected initial topology by the…

Based on the concept and techniques of first-passage probability in Markov chain theory, this letter provides a rigorous proof for the existence of the steady-state degree distribution of the scale-free network generated by the…

While previous works have shown that an overwhelming number of scale-free networks are sparse, there still exist some real-world networks including social networks, urban networks, information networks, which are by observation dense. In…

The scale-free (SF) structure that commonly appears in many complex networks is one of the hot topics related to social, biological, and information sciences. The self-organized generation mechanisms are expected to be useful for efficient…

In a recursive way and by including a parameter, we introduce a family of deterministic scale-free networks. The resulting networks exhibit small-world effects. We calculate the exact results for the degree exponent, the clustering…

Many real life networks present an average path length logarithmic with the number of nodes and a degree distribution which follows a power law. Often these networks have also a modular and self-similar structure and, in some cases -…

In random graph models, the degree distribution of an individual node should be distinguished from the (empirical) degree distribution of the graph that records the fractions of nodes with given degree. We introduce a general framework to…

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…

One of the main characteristics of real-world networks is their large clustering. Clustering is one aspect of a more general but much less studied structural organization of networks, i.e. edge multiplicity, defined as the number of…

The sampling of scale-free networks in Molecular Biology is usually achieved by growing networks from a seed using recursive algorithms with elementary moves which include the addition and deletion of nodes and bonds. These algorithms…

We introduce a simple one-parameter network growth algorithm which is able to reproduce a wide variety of realistic network structures but without having to invoke any global information about node degrees such as preferential-attachment…

The coupling of scale-free networks with mobile unstructured networks is certainly unusual. In mobile networks, connections active at a given instant are constrained by the geographical distribution of mobile nodes, and by the limited…

We study a deterministic scale-free network recently proposed by Barab\'{a}si, Ravasz and Vicsek. We find that there are two types of nodes: the hub and rim nodes, which form a bipartite structure of the network. We first derive the exact…

In this paper, we propose a simple rule that generates scale-free small-world networks with tunable assortative coefficient. These networks are constructed by two-stage adding process for each new node. The model can reproduce scale-free…

Co-evolution exhibited by a network system, involving the intricate interplay between the dynamics of the network itself and the subsystems connected by it, is a key concept for understanding the self-organized, flexible nature of…

A scale-free network is grown in the Euclidean space with a global directional bias. On a vertical plane, nodes are introduced at unit rate at randomly selected points and a node is allowed to be connected only to the subset of nodes which…