# Generation of uncorrelated random scale-free networks.

@article{Catanzaro2005GenerationOU,
title={Generation of uncorrelated random scale-free networks.},
author={Michele Catanzaro and Mari{\'a}n Bogu{\~n}{\'a} and Romualdo Pastor-Satorras},
journal={Physical review. E, Statistical, nonlinear, and soft matter physics},
year={2005},
volume={71 2 Pt 2},
pages={
027103
}
}
• Published 5 August 2004
• Computer Science
• Physical review. E, Statistical, nonlinear, and soft matter physics
Uncorrelated random scale-free networks are useful null models to check the accuracy and the analytical solutions of dynamical processes defined on complex networks. We propose and analyze a model capable of generating random uncorrelated scale-free networks with no multiple and self-connections. The model is based on the classical configuration model, with an additional restriction on the maximum possible degree of the vertices. We check numerically that the proposed model indeed generates…
541 Citations

## Figures from this paper

### Gradient networks on uncorrelated random scale-free networks

• Computer Science
• 2011
Findings show that the uncorrelated scale-free structure might allow more efficient transport than the random structure, and the relations between the topological structure and the transport efficiency of the gradient networks.

### Clustering of random scale-free networks

• Computer Science
Physical review. E, Statistical, nonlinear, and soft matter physics
• 2012
The finite-size dependence of the clustering coefficient of scale-free random graphs generated by the configuration model with degree distribution exponent 2<γ<3.5 implies that a single-instance network is not representative of the ensemble even for very large network sizes.

### Asymptotic properties of degree-correlated scale-free networks.

• Computer Science
Physical review. E, Statistical, nonlinear, and soft matter physics
• 2010
Analytical relations for the Pearson correlation coefficient r of these extremal configurations are derived and shown to provide lower and upper bounds on the possible r values, which are found to vanish for large networks.

### . Characterizing the intrinsic correlations of scale-free networks

• Physics
ArXiv
• 2015
The results indicate that random scale-free networks models are not self-averaging, that is, the second moment of their degree distribution may vary orders of magnitude among different realizations, and it is argued that the intrinsic correlations investigated here may have profound impact on the critical properties of random Scale-free Networks.

### Generation of arbitrarily two-point-correlated random networks.

• Computer Science
Physical review. E, Statistical, nonlinear, and soft matter physics
• 2007
An efficient and accurate algorithm to generate arbitrarily two-point degree-degree correlated undirected random networks without self-edges or multiple edges among vertices is described and a formalism to construct a joint degree distribution P(j,k) is developed, which allows one to fix an arbitrary degree distribution and an arbitrary average nearest neighbor function k_{nn}(k) simultaneously.

### Scaling of degree correlations and its influence on diffusion in scale-free networks.

• Computer Science
Physical review letters
• 2008
Scaling theory is used to quantify the degree of correlations in the particular case of networks with a power-law degree distribution and finds that anticorrelations tend to accelerate the diffusion process, which can be used to study robustness or diffusion.

### Scaling of nearest neighbors' connectivity distribution for scale-free networks

• Computer Science
• 2015
This work provides a systematic study combined with theoretical and empirical demonstrations, which reveal the inherent connectivity profile of real-world networks, and proposes a degree correlation spectra approach beyond the widely used Pearson correlation coefficient.

### Intrinsic degree-correlations in the static model of scale-free networks

• Physics
• 2006
Abstract. We calculate the mean neighboring degree function $\bar k_{\rm{nn}}(k)$ and the mean clustering function C(k) of vertices with degree k as a function of k in finite scale-free random

### Generating random networks with given degree-degree correlations and degree-dependent clustering.

• Computer Science
Physical review. E, Statistical, nonlinear, and soft matter physics
• 2008
An algorithm is presented which is able to construct arbitrarily degree-degree correlated networks with adjustable degree-dependent clustering and is verified by using empirical networks as input and described additionally a simple way to fix a degree- dependent clustering function if degree- degree correlations are given.

## References

SHOWING 1-10 OF 69 REFERENCES

### Class of correlated random networks with hidden variables.

• Mathematics
Physical review. E, Statistical, nonlinear, and soft matter physics
• 2003
The general model is extended to describe a practical algorithm to generate random networks with an a priori specified correlation structure and an extension is presented, to map nonequilibrium growing networks to networks with hidden variables that represent the time at which each vertex was introduced in the system.

### Emergence of scaling in random networks

• Computer Science
Science
• 1999
A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.

### Uncorrelated random networks.

• Computer Science
Physical review. E, Statistical, nonlinear, and soft matter physics
• 2003
It is found that in the absence of dynamical internode correlations the degree distribution is cut at a degree value scaling like N(gamma), with gamma=min[1/2,1/(beta-1)], where N is the total number of nodes.

### Epidemic spreading in scale-free networks.

• Computer Science
Physical review letters
• 2001
A dynamical model for the spreading of infections on scale-free networks is defined, finding the absence of an epidemic threshold and its associated critical behavior and this new epidemiological framework rationalizes data of computer viruses and could help in the understanding of other spreading phenomena on communication and social networks.

### Cut-offs and finite size effects in scale-free networks

• Mathematics
• 2003
Abstract.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

### Epidemic spreading in correlated complex networks.

• Mathematics
Physical review. E, Statistical, nonlinear, and soft matter physics
• 2002
A dynamical model of epidemic spreading on complex networks in which there are explicit correlations among the node's connectivities finds an epidemic threshold inversely proportional to the largest eigenvalue of the connectivity matrix that gives the average number of links.

### Large-scale topological and dynamical properties of the Internet.

• Computer Science
Physical review. E, Statistical, nonlinear, and soft matter physics
• 2002
It is found that the connectivity structure of the Internet presents statistical distributions settled in a well-defined stationary state and the large-scale properties are characterized by a scale-free topology consistent with previous observations.

### Origin of degree correlations in the Internet and other networks.

• Geology
Physical review. E, Statistical, nonlinear, and soft matter physics
• 2003
The results confirm that the conjectured mechanism does indeed give rise to correlations of the kind seen in the Internet, although only a part of the measured correlation can be accounted for in this way.

### Perturbing general uncorrelated networks.

• Mathematics
Physical review. E, Statistical, nonlinear, and soft matter physics
• 2004
It is shown that the results obtained for Erdös-Rényi graphs are generic, at the qualitative level, but scale-free graphs are an exception to this general rule and exhibit a singular behavior, studied thoroughly in this paper.