Binomial approximation of non-isolated vertices in a random graph

MaRDI QIDQ4904756zbMATH OpenFDO

Authors K. Teerapabolarn

Publication date 31 January 2013

Full work available at URL http://www.ijpam.eu/contents/2012-81-1/14/index.html

zbMATH Keywords

binomial approximationisolated vertexrandom graphStein's method

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Approximations to statistical distributions (nonasymptotic) (62E17)

Recommendations

• Compound Poisson approximations of subgraph counts in random graphs
• A pointwise approximation of isolated trees in a random graph
• A Berry-Esseen bound with applications to vertex degree counts in the Erdős-Rényi random graph
• A bound on normal approximation of number of vertices of a fixed degree in a random graph
• scientific article; zbMATH DE number 5310725

Cited in

(4)

• scientific article; zbMATH DE number 5310725 (Why is no real title available?)
• scientific article; zbMATH DE number 5369609 (Why is no real title available?)
• A non-uniform bound on binomial approximation withw-functions
• A pointwise approximation of isolated trees in a random graph

This page was built for publication: Binomial approximation of non-isolated vertices in a random graph

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