Estimating global subgraph counts by sampling

DOI10.37236/11618zbMath1520.60005arXiv2210.11336MaRDI QIDQ6162129

Svante Janson, Valentas Kurauskas

Publication date: 15 June 2023

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2210.11336

zbMATH Keywords

homomorphismcombinatorial probabilitysubgraph count

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Combinatorial probability (60C05)

Cites Work

• Unnamed Item
• Limit theorems for a random graph epidemic model
• A partially ordered set of functionals corresponding to graphs
• Percolation
• An Optimal Algorithm for Monte Carlo Estimation
• Unimodular random trees
• On local weak limit and subgraph counts for sparse random graphs