Crossings in Randomly Embedded Graphs

MaRDI QIDQ6398566zbMATH OpenFDO

Authors Santiago Arenas-Velilla, Octavio Arizmendi

Publication date 8 May 2022

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Abstract: We consider the number of crossings in a graph which is embedded randomly on a convex set of points. We give an estimate to the normal distribution in Kolmogorov distance which implies a convergence rate of order $n^{-1/2}$ for various families of graphs, including random chord diagrams or full cycles.

This page was built for publication: Crossings in Randomly Embedded Graphs

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