Journal
PHYSICAL REVIEW E
Volume 70, Issue 5, Pages -Publisher
AMER PHYSICAL SOC
DOI: 10.1103/PhysRevE.70.056115
Keywords
-
Categories
Ask authors/readers for more resources
We present an algorithm for generating random networks with arbitrary degree distribution and clustering (frequency of triadic closure). We use this algorithm to generate networks with exponential, power law, and Poisson degree distributions with variable levels of clustering. Such networks may be used as models of social networks and as a testable null hypothesis about network structure. Finally, we explore the effects of clustering on the point of the phase transition where a giant component forms in a random network, and on the size of the giant component. Some analysis of these effects is presented.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available