Compound Poisson approximations of subgraph counts in random graphs

DOI<39::AID-RSA4>3.0.CO;2-B 10.1002/1098-2418(200101)18:1<39::AID-RSA4>3.0.CO;2-BzbMath0968.05070OpenAlexW2004724407MaRDI QIDQ4761357

Dudley Stark

Publication date: 22 May 2001

Full work available at URL: https://doi.org/10.1002/1098-2418(200101)18:1<39::aid-rsa4>3.0.co;2-b

zbMATH Keywords

compound Poissonbalanced graphstotal variation distance

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (4)

Motif-based tests for bipartite networks ⋮ Variational Bayes model averaging for graphon functions and motif frequencies inference in \(W\)-graph models ⋮ Poisson approximation of subgraph counts in stochastic block models and a graphon model ⋮ Compound Poisson approximation of subgraph counts in stochastic block models with multiple edges

Cites Work

• Compound Poisson approximation for nonnegative random variables via Stein's method
• Stein's method for compound Poisson approximation: The local approach
• Compound Poisson approximation for Markov chains using Stein's method
• Poisson convergence and random graphs
• Unnamed Item

This page was built for publication: Compound Poisson approximations of subgraph counts in random graphs