Normal and stable approximation to subgraph counts in superpositions of Bernoulli random graphs

DOI10.1017/JPR.2023.48arXiv2107.02683OpenAlexW3177680641MaRDI QIDQ6372118

Joona Karjalainen, Mindaugas Bloznelis, Lasse Leskelä

Publication date: 6 July 2021

Full work available at URL: https://doi.org/10.1017/jpr.2023.48

Mathematics Subject Classification ID

Clustering in the social and behavioral sciences (91C20) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Combinatorial probability (60C05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

This page was built for publication: Normal and stable approximation to subgraph counts in superpositions of Bernoulli random graphs