Compound Poisson approximations of subgraph counts in random graphs

DOI10.1002/1098-2418(200101)18:1%3C39::AID-RSA4%3E3.0.CO;2-BMaRDI QIDQ4761357zbMATH OpenOpenAlexFDO

Authors Dudley Stark

Publication date 22 May 2001

Full work available at URL https://doi.org/10.1002/1098-2418(200101)18:1%3C39::aid-rsa4%3E3.0.co;2-b

zbMATH Keywords

balanced graphscompound Poissontotal variation distance

Mathematics Subject Classification ID

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

Recommendations

• Compound Poisson approximation of subgraph counts in stochastic block models with multiple edges
• Poisson approximation of subgraph counts in stochastic block models and a graphon model
• Poisson approximation of counts of induced subgraphs in random intersection graphs
• Poisson approximation of induced subgraph counts in an inhomogeneous random intersection graph model
• scientific article; zbMATH DE number 5310725
• Concentration for Poisson \(U\)-statistics: subgraph counts in random geometric graphs
• Subgraph counts for dense random graphs with specified degrees
• Poisson approximation of the number of cliques in random intersection graphs
• Local limit theorems for subgraph counts

Cites work

• Compound Poisson approximation for Markov chains using Stein's method
• Compound Poisson approximation for nonnegative random variables via Stein's method
• scientific article; zbMATH DE number 868186 (Why is no real title available?)
• Poisson convergence and random graphs
• Stein's method for compound Poisson approximation: The local approach

Cited in

(18)

• Motif-based tests for bipartite networks
• Concentration for Poisson functionals: component counts in random geometric graphs
• The bound on Poisson approximation for the number of induced copies of a fixed graph in a random graph
• Poisson approximation for the number of isolated trees in a random intersection graph
• Poisson approximation of subgraph counts in stochastic block models and a graphon model
• Variational Bayes model averaging for graphon functions and motif frequencies inference in \(W\)-graph models
• scientific article; zbMATH DE number 5310725 (Why is no real title available?)
• The bounds on Poisson approximation of the number of copies of a fixed graph in a random d-regular graph
• A Poisson approximation for coloured graphs under exchangeability
• Inhomogeneous random graphs, isolated vertices, and Poisson approximation
• Maximal full subspaces in random projective spaces—thresholds and Poisson approximation
• scientific article; zbMATH DE number 850234 (Why is no real title available?)
• Binomial approximation of non-isolated vertices in a random graph
• Compound Poisson approximation of subgraph counts in stochastic block models with multiple edges
• POISSON APPROXIMATION FOR THE NUMBER OF OPIES OF A FIXED GRAPH IN A RANDOM d-REGULAR GRAPH
• A pointwise approximation of isolated trees in a random graph
• Kolmogorov bounds for decomposable random variables and subgraph counting by the Stein-Tikhomirov method
• Characterization of the asymptotic behaviour of U-statistics on row-column exchangeable matrices

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4761357)