Relaxation dynamics of maximally clustered networks

Research output: Contribution to journalArticlepeer-review

Authors

Colleges, School and Institutes

External organisations

  • The University of Warwick

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.

Details

Original languageEnglish
Number of pages8
JournalPhysical Review E
Volume97
Early online date3 Jan 2018
Publication statusE-pub ahead of print - 3 Jan 2018