Random graph generation using multiple switches of edges

MaRDI QIDQ5355315zbMATH OpenFDO

Authors Lionel Tabourier, Jean-Philippe Cointet, Camille Roth

Publication date 7 September 2017

Full work available at URL http://journal-sfds.fr/article/view/623

zbMATH Keywords

random graphsMCMC algorithmsgraph generation

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Random graphs (graph-theoretic aspects) (05C80) Randomized algorithms (68W20) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Recommendations

• Generating constrained random graphs using multiple edge switches
• Controlled Markovian dynamics of graphs: unbiased generation of random graphs with prescribed topological properties
• Generating graphs randomly
• Generating random networks without short cycles
• Generating simple random graphs with prescribed degree distribution

Cited in

(8)

• Generating realistic labelled, weighted random graphs
• Generating constrained random graphs using multiple edge switches
• Gaussian networks generated by random walks
• Generating random networks from a given distribution
• Motifs, coherent configurations and second order network generation
• Interactive random graph generation with evolutionary algorithms
• Switching edges to randomize networks : What goes wrong and how to fix it
• Controlled Markovian dynamics of graphs: unbiased generation of random graphs with prescribed topological properties

This page was built for publication: Random graph generation using multiple switches of edges

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