Relaxation dynamics of maximally clustered networks
arXiv:1708.07739 · doi:10.1103/PhysRevE.97.012302
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.
References in corpus (8)
- Random graphs with clustering
- Percolation and Epidemic Thresholds in Clustered Networks
- Efficient and exact sampling of simple graphs with given arbitrary degree sequence
- Clustering in complex networks. I. General formalism
- The entropic origin of disassortativity in complex networks
- Clustering in complex networks. II. Percolation properties
- Solution for the properties of a clustered network
- Kinetics of Ring Formation