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

DOI10.1093/COMNET/CNAD046MaRDI QIDQ7026698zbMATH OpenFDO

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

Publication date 17 February 2025

Published in Journal of Complex Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/COMNET/CNAD046

zbMATH Keywords

degree-preserving growthmatching theorynetwork growth modelspower-law degree distributionsynthetic networks

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Cites work

• A critical point for random graphs with a given degree sequence
• A method in graph theory
• A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• A random graph model for massive graphs
• Approximating the Permanent
• Collective dynamics of `small-world' networks
• Connectivity of random regular graphs generated by the pegging algorithm
• Emergence of Scaling in Random Networks
• Enumeration of graphs with a heavy-tailed degree sequence
• Fast uniform generation of random graphs with given degree sequences
• scientific article; zbMATH DE number 3186565 (Why is no real title available?)
• Mixing time of the switch Markov chain and stable degree sequences
• On an estimate of the chromatic class of a \(p\)-graph
• On counting perfect matchings in general graphs
• Paths, Trees, and Flowers
• Rate of convergence of the short cycle distribution in random regular graphs generated by pegging
• Sampling Regular Graphs and a Peer-to-Peer Network
• Short cycle distribution in random regular graphs recursively generated by pegging
• The average distances in random graphs with given expected degrees
• The mixing time of switch Markov chains: a unified approach
• The sequence of prime gaps is graphic
• Uniform generation of random graphs with power-law degree sequences

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7026698)