2023/08/22 by Santiago Arenas-Velilla, Arenas-Velilla, Santiago, Octavio Arizmendi +3
Computer Science · Mathematics · #60C05 #60F05 #Combinatorics (math.CO) #FOS: Mathematics #Geometry and complex manifolds #Probability (math.PR) #Stochastic processes and statistical mechanics #Topological and Geometric Data Analysis
paper · pdf · doi:10.48550/arxiv.2308.11570
openalex publication_date 2023/08/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01
We consider the number of crossings in a random embedding of a graph, G, with vertices in convex position. We give explicit formulas for the mean and variance of the number of crossings as a function of various subgraph counts of G. Using Stein's method and size-bias coupling, we establish an upper bound on the Kolmogorov distance between the distribution of the number of crossings and a standard normal random variable. We also consider the case where G is a random graph and obtain a Kolmogorov bound between the distribution of crossings and a Gaussian mixture distribution. As applications, we obtain central limit theorems with convergence rates for the number of crossings in random embeddings of matchings, path graphs, cycle graphs, disjoint union of triangles, random d-regular graphs, and mixtures of random graphs.