We introduce a minimal generative model for densifying networks in which a new node attaches to a randomly selected target node and also to each of its neighbors with probability p. The networks that emerge from this copying mechanism are sparse for p<1/2 and dense (average degree increasing with number of nodes N) for p≥1/2. The behavior in the dense regime is especially rich; for example, individual network realizations that are built by copying are disparate and not self-averaging. Further, there is an infinite sequence of structural anomalies at p=2/3, 3/4, 4/5, etc., where the N dependences of the number of triangles (3-cliques), 4-cliques, undergo phase transitions. When linking to second neighbors of the target can occur, the probability that the resulting graph is complete-all nodes are connected-is nonzero as N→∞.
[1]
C. Markert,et al.
Evolution of the Gene
,
1948,
Nature.
[2]
B. M. Fulk.
MATH
,
1992
.
[3]
Albert-László Barabási,et al.
Evolution of Networks: From Biological Nets to the Internet and WWW
,
2004
.
[4]
Mark E. J. Newman,et al.
Structure and Dynamics of Networks
,
2009
.
[5]
Alessandro Vespignani,et al.
Dynamical Processes on Complex Networks
,
2008
.
[6]
Mark Newman,et al.
Networks: An Introduction
,
2010
.
[7]
L. Christophorou.
Science
,
2018,
Emerging Dynamics: Science, Energy, Society and Values.