arXiv · cond-mat/0508434
Two-level relationships and Scale-Free Networks
Abstract
Through the distinction between ``real'' and ``virtual'' links between the nodes of a graph, we develop a set of simple rules leading to scale-free networks with a tunable degree distribution exponent. Albeit sharing some similarities with preferential attachment, our procedure is both faster than a naïve implementation of the Barabási and Albert model and exhibits different clustering properties. The model is thoroughly studied numerically and suggests that reducing the set of partners a node can connect to is important in seizing the diversity of scale-free structures.
Explore related subjects
Keep this discovery
F. Stauffer. 2006-05-16. Two-level relationships and Scale-Free Networks. https://doi.org/10.1016/j.physa.2005.12.070
Cite the original work for its findings. Save a collection to share your selection of sources.