scientific article; zbMATH DE number 5863938

MaRDI QIDQ3082422zbMATH OpenFDO

Authors Adchara Kumla, Angkana Boonyued

Publication date 10 March 2011

Full work available at URL http://pphmj.com/abstract/5560.htm

zbMATH Keywords

birthday problemcomplete graphPoisson approximationrandom graphstrong birthday problem

Mathematics Subject Classification ID

Combinatorial probability (60C05)

Recommendations

• The bound on Poisson approximation for the number of induced copies of a fixed graph in a random graph
• The bounds on Poisson approximation of the number of copies of a fixed graph in a random d-regular graph
• POISSON APPROXIMATION FOR THE NUMBER OF OPIES OF A FIXED GRAPH IN A RANDOM d-REGULAR GRAPH
• Bounds on probability of group connectedness of a random graph
• Poisson approximation of the number of cliques in random intersection graphs
• Poisson approximation of counts of induced subgraphs in random intersection graphs
• Poisson convergence in the restricted k‐partitioning problem
• Strong law of large numbers on graphs and groups
• Poisson convergence and semi-induced properties of random graphs
• Poisson convergence of numbers of vertices of a given degree in random graphs

This page was built for publication:

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