Abstract
We study the relaxation dynamics of fully clustered networks (maximal number of triangles) to an unclustered state under two different edge dynamics—the double-edge swap, corresponding to degree-preserving randomization of the configuration model, and single edge replacement, corresponding to full randomization
of the Erdős–Rényi random graph. We derive expressions for the time evolution of the degree distribution, edge multiplicity distribution and clustering coefficient. We show that under both dynamics networks undergo a continuous phase transition in which a giant connected component is formed. We calculate the position of the phase transition analytically using the Erdős–Rényi phenomenology.
of the Erdős–Rényi random graph. We derive expressions for the time evolution of the degree distribution, edge multiplicity distribution and clustering coefficient. We show that under both dynamics networks undergo a continuous phase transition in which a giant connected component is formed. We calculate the position of the phase transition analytically using the Erdős–Rényi phenomenology.
Original language | English |
---|---|
Number of pages | 8 |
Journal | Physical Review E |
Volume | 97 |
Early online date | 3 Jan 2018 |
DOIs | |
Publication status | E-pub ahead of print - 3 Jan 2018 |