Related papers: Are Barabasi-Albert networks self-averaging?

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…

Complex networks have been mostly characterized from the point of view of the degree distribution of their nodes and a few other motifs (or modules), with a special attention to triangles and cliques. The most exotic phenomena have been…

In this paper, we investigate the collective synchronization of system of coupled oscillators on Barab\'{a}si-Albert scale-free network. We propose an approach of structural perturbations aiming at those nodes with maximal betweenness. This…

We numerically investigate the scale-free network model of Barab{\'a}si and Albert [A. L. Barab{\'a}si and R. Albert, Science {\bf 286}, 509 (1999)] through the use of various path finding strategies. In real networks, global network…

Many real-world networks have properties of small-world networks, with clustered local neighborhoods and low average-shortest path (ASP). They may also show a scale-free degree distribution, which can be generated by growth and preferential…

Complex networks have gained more attention from the last few years. The size of real-world complex networks, such as online social networks, WWW network, collaboration networks, is increasing exponentially with time. It is not feasible to…

We consider the voter model dynamics in random networks with an arbitrary distribution of the degree of the nodes. We find that for the usual node-update dynamics the average magnetization is not conserved, while an average magnetization…

We consider nonequilibrium phase transitions in weighted scale-free networks, in which highly connected nodes, which are created earlier in time are partially immunized. For epidemic spreading we solve the dynamical mean-field equations and…

In this Letter, we propose a growing network model that can generate scale-free networks with a tunable community strength. The community strength, $C$, is directly measured by the ratio of the number of external edges to internal ones; a…

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.…

In a network cliques are fully connected subgraphs that reveal which are the tight communities present in it. Cliques of size c>3 are present in random Erdos and Renyi graphs only in the limit of diverging average connectivity. Starting…

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…

The reliability of electric transmission systems is examined using a scale-free model of network structure and failure propagation. The topologies of the North American eastern and western electric networks are analyzed to estimate their…

We analyze the correlation properties of the Erdos-Renyi random graph (RG) and the Barabasi-Albert scale-free network (SF) under the attack and repair strategy with detrended fluctuation analysis (DFA). The maximum degree k_max,…

Very often, when studying topological or dynamical properties of random scale-free networks, it is tacitly assumed that degree-degree correlations are not present. However, simple constraints, such as the absence of multiple edges and…

Barab\'asi-Albert model describes many different natural networks, often yielding sensible explanations to the subjacent dynamics. However, finite size effects may prevent from discerning among different underlying physical mechanisms and…

Using a mean-field network formulation of the Bass innovation diffusion model and exact results by Fotouhi and Rabbat on the degree correlations of Barabasi-Albert networks, we compute the times of the diffusion peak and compare them with…

Scale-free networks are characterized by a degree distribution with power-law behavior and have been shown to arise in many areas, ranging from the World Wide Web to transportation or social networks. Degree distributions of observed…

Universal scaling of distances between vertices of Erdos-Renyi random graphs, scale-free Barabasi-Albert models, science collaboration networks, biological networks, Internet Autonomous Systems and public transport networks are observed. A…

A wealth of evidence shows that real world networks are endowed with the small-world property i.e., that the maximal distance between any two of their nodes scales logarithmically rather than linearly with their size. In addition, most…