The sizes of components in random circle graphs

DOI10.7151/DMGT.1424MaRDI QIDQ3633843zbMATH OpenOpenAlexFDO

Authors Ramin Imany Nabiyyi

Publication date 23 June 2009

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/a2c0e8d857e21550c38dec0485c6bb918b3e6895

zbMATH Keywords

geometric graphsgeometric probabilityrandom interval graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Geometric probability and stochastic geometry (60D05)

Recommendations

• Random covering of the circle: the size of the connected components
• scientific article; zbMATH DE number 219310
• scientific article; zbMATH DE number 3168330
• On the Behavior of a Random Graph Near a Critical Point
• On the connectivity of a random interval graph

Cited in

(3)

• The Vietoris-Rips complexes of a circle
• The component sizes of a critical random graph with given degree sequence
• Component averages in subgraphs of circulant-like graphs

This page was built for publication: The sizes of components in random circle graphs

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