Generating constrained random graphs using multiple edge switches

DOI10.1145/1963190.2063515zbMath1284.05249arXiv1012.3023OpenAlexW1996701018MaRDI QIDQ5406240

Jean-Philippe Cointet, Lionel Tabourier, Camille Roth

Publication date: 1 April 2014

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1012.3023

zbMATH Keywords

random graphsedge switchingconstrained graphs generation methodMarkov chain mixing

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Continuous-time Markov processes on discrete state spaces (60J27)

Related Items (2)

Firm-network characteristics and economic robustness to natural disasters ⋮ Configuring Random Graph Models with Fixed Degree Sequences

This page was built for publication: Generating constrained random graphs using multiple edge switches