Clustered Power-Law Networks
A network in which the degree distribution follows a power law can be constructed through a process of preferential attachment in which the probability that a new node connects with an existing node is proportional to the fraction of edges already incoming to . As shown by Holme & Kim in 2002, one can construct a network in which the degree distribution follows a power law but also exhibits "clustering" by requiring that, in some fraction of cases (), a new node connects to a random selection of the neighbors of the node to which last connected. This Demonstration permits the user to construct an undirected clustered powerÃ¢ÂÂlaw network by letting them select , the number of edges to be created, and the bounds on the uniform distribution that determines the number of edges that will emerge from each new node.
P. Holme and B.J. Kim, "Growing Scale-Free Networks with Tunable Clustering," Physical Review [Online Archive], 65(2), 2002 pp. 1-4. http://prola.aps.org/abstract/PRE/v65/i2/e026107.
Snapshot 1: a high number of edges
Snapshot 2: a high proportion of clustered nodes