Normal approximation for subgraph counts in random intersection graphs: the case of edges

arXiv:2503.23110 · math.CO, math.PR · Submitted 2025-03-29 · Read on arXiv

math.CO, math.PR

Submitted: 2025-03-29

Updated: 2026-10-20

Terminology

• Asymptotic Normality — 1× in this paper · explained in 2 episodes
• Kolmogorov Distance — 1× in this paper · explained in 2 episodes

Related papers

• Exponential random graph models with soft clique constraints
• Two Linear Programs are Better than One
• Exact Enumeration of Phylogenetic Networks: The Tree-Child, Reticulation-Visible and Orchard Hierarchy
• A complete classification of perfect state transfer in Grover walks on abelian Cayley graphs
• Arithmetic Circuits and Neural Networks for Regular Matroids
• On composition and decomposition operations for vector spaces, graphs and matroids