arXiv · cond-mat/0311650
Cut-offs and finite size effects in scale-free networks
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 induced by the connectivity structure of the network. Even in the simple case of uncorrelated networks, we obtain an expression of the structural cut-off that is smaller that the natural cut-off obtained by means of extremal theory arguments. The obtained results are explicitly applied in the case of the configuration model to recover the size scaling of tadpoles and multiple edges.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Marian Boguna, Romualdo Pastor-Satorras, Alessandro Vespignani. 2004-01-15. Cut-offs and finite size effects in scale-free networks. https://doi.org/10.1140/epjb%2Fe2004-00038-8
Cite the original work for its findings. Save a collection to share your selection of sources.