Compound Poisson approximation of subgraph counts in stochastic block models with multiple edges
From MaRDI portal
Publication:5215024
DOI10.1017/apr.2018.35zbMath1457.90038arXiv1710.06341OpenAlexW2963449512WikidataQ128937877 ScholiaQ128937877MaRDI QIDQ5215024
Robert E. Gaunt, Matthew Coulson, Gesine D. Reinert
Publication date: 5 February 2020
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.06341
Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80) Stochastic network models in operations research (90B15) Approximations to statistical distributions (nonasymptotic) (62E17)
Cites Work
- Modeling heterogeneity in random graphs through latent space models: a selective review
- Variational Bayes model averaging for graphon functions and motif frequencies inference in \(W\)-graph models
- Two moments suffice for Poisson approximations: The Chen-Stein method
- Compound Poisson approximation for nonnegative random variables via Stein's method
- Poisson approximation for dependent trials
- Stein's method for compound Poisson approximation: The local approach
- Estimating Stein's constants for compound Poisson approximation
- On magic factors in Stein's method for compound Poisson approximation
- Central limit theorems in the configuration model
- Compound Poisson approximation: A user's guide
- Poisson approximation of subgraph counts in stochastic block models and a graphon model
- Markov Graphs
- Poisson convergence and random graphs
- Solving the Stein Equation in compound poisson approximation
- Estimation and Prediction for Stochastic Blockstructures
- Community structure in social and biological networks
- A critical point for random graphs with a given degree sequence
- Poisson approximation for some statistics based on exchangeable trials
- Compound Poisson approximations of subgraph counts in random graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Compound Poisson approximation of subgraph counts in stochastic block models with multiple edges
