Degree-preserving graph dynamics -- a versatile process to construct random networks

DOI10.1093/COMNET/CNAD046zbMatharXiv:2111.11994MaRDI QIDQ6505259

Shubha R. Kharel, Péter L. Erdős, Tamás Róbert Mezei, Zoltán Toroczkai

Publication date: 1 January 1

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Vertex degrees (05C07)

This page was built for publication: Degree-preserving graph dynamics -- a versatile process to construct random networks