相关论文: Growth of scale-free networks under heterogeneous …

Conventional studies of network growth models mainly look at the steady state degree distribution of the graph. Often long time behavior is considered, hence the initial condition is ignored. In this contribution, the time evolution of the…

The Internet, as well as many other networks, has a very complex connectivity recently modeled by the class of scale-free networks. This feature, which appears to be very efficient for a communications network, favors at the same time the…

In this paper, we propose an evolving network model growing fast in units of module, based on the analysis of the evolution characteristics in real complex networks. Each module is a small-world network containing several interconnected…

We propose a novel measure of degree heterogeneity, for unweighted and undirected complex networks, which requires only the degree distribution of the network for its computation. We show that the proposed measure can be applied to all…

The dynamics of Boolean networks (the N-K model) with scale-free topology are studied here. The existence of a phase transition governed by the value of the scale-free exponent of the network is shown analytically by analyzing the overlap…

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 investigate a growing network model that combines preferential and uniform attachment with two distinct mechanisms of edge deletion. In addition to the usual uniform probability edge deletion, we introduce a novel node-based rule in…

There has been a considerable amount of interest in recent years on the robustness of networks to failures. Many previous studies have concentrated on the effects of node and edge removals on the connectivity structure of a static network;…

We introduce a deterministic model for scale-free networks, whose degree distribution follows a power-law with the exponent $\gamma$. At each time step, each vertex generates its offsprings, whose number is proportional to the degree of…

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…

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…

We study scale free simple graphs with an exponent of the degree distribution $\gamma$ less than two. Generically one expects such extremely skewed networks -- which occur very frequently in systems of virtually or logically connected units…

A growing family of random graphs is called robust if it retains a giant component after percolation with arbitrary positive retention probability. We study robustness for graphs, in which new vertices are given a spatial position on the…

Biased (degree-dependent) percolation was recently shown to provide new strategies for turning robust networks fragile and vice versa. Here we present more detailed results for biased edge percolation on scale-free networks. We assume a…

Random graphs with power-law degrees can model scale-free networks as sparse topologies with strong degree heterogeneity. Mathematical analysis of such random graphs proved successful in explaining scale-free network properties such as…

The origin of scale-free degree distributions in the context of networks is addressed through an analogous non-network model in which the node degree corresponds to the number of balls in a box and the rewiring of links to balls moving…

The paper is concerned with the interplay between network structure and traffic dynamics in a communications network, from the viewpoint of end-to-end performance of packet transfer. We use a model of network generation that allows the…

This paper is concerned with the characterization of the relationship between topology and traffic dynamics. We use a model of network generation that allows the transition from random to scale free networks. Specifically, we consider three…

In their recent work "Scale-free networks are rare", Broido and Clauset address the problem of the analysis of degree distributions in networks to classify them as scale-free at different strengths of "scale-freeness." Over the last two…

It is commonly believed that scale-free networks are robust to massive numbers of random node deletions. For example, Cohen et al. study scale-free networks including some which approximate the measured degree distribution of the Internet.…