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.