The bound on Poisson approximation for the number of induced copies of a fixed graph in a random graph

DOI10.17654/FJMSNOV2015_547_561zbMATH Open1338.05246OpenAlexW2520161845MaRDI QIDQ2811366FDOQ2811366

Authors: Mana Donganont 

Publication date: 10 June 2016

Published in: Far East Journal of Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.17654/fjmsnov2015_547_561

Recommendations

• POISSON APPROXIMATION FOR THE NUMBER OF OPIES OF A FIXED GRAPH IN A RANDOM d-REGULAR GRAPH
• The bounds on Poisson approximation of the number of copies of a fixed graph in a random d-regular graph
• Compound Poisson approximations of subgraph counts in random graphs
• Induced subgraph in random regular graph
• Poisson approximation of counts of induced subgraphs in random intersection graphs

zbMATH Keywords

Poisson distributionrandom graphStein's methodinduced subgraphrandom regular graphlocal approachstrictly balancedcopy of graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Cited In (4)

• Title not available (Why is that?)
• POISSON APPROXIMATION FOR THE NUMBER OF OPIES OF A FIXED GRAPH IN A RANDOM d-REGULAR GRAPH
• A bound on normal approximation of number of vertices of a fixed degree in a random graph
• The bounds on Poisson approximation of the number of copies of a fixed graph in a random d-regular graph

This page was built for publication: The bound on Poisson approximation for the number of induced copies of a fixed graph in a random graph

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