A method for generating connected Erdős-Rényi random graphs

DOI10.1093/COMNET/CNAG015MaRDI QIDQ7320933zbMATH OpenFDO

Authors Boris Chinyaev

Publication date 28 August 2026

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

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

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Connectivity (05C40) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial probability (60C05)

Cites work

• Asymptotic properties of labeled connected graphs
• Ballot theorems, old and new
• Counting connected graphs and hypergraphs via the probabilistic method
• Counting connected graphs asymptotically
• Efficient and simple generation of random simple connected graphs with prescribed degree sequence
• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• On the Probability of Connectedness of a Random Graph $\mathcal{G}_m (t)$
• On the strength of connectedness of a random graph
• The connectivity of graphs of graphs with self-loops and a given degree sequence
• The Evolution of Random Graphs
• Uniform sampling of bipartite graphs with degrees in prescribed intervals

This page was built for publication: A method for generating connected Erdős-Rényi random graphs

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