Poisson approximation for the number of isolated trees in a random intersection graph

DOI10.12732/IJPAM.V88I1.9MaRDI QIDQ2867709zbMATH OpenOpenAlexFDO

Authors Mana Dongoanont

Publication date 20 December 2013

Published in International Journal of Pure and Applied Mathematics (Search for Journal in Brave)

Full work available at URL http://www.ijpam.eu/contents/2013-88-1/9/index.html

zbMATH Keywords

random intersection graphisolated trees and Stein-Chen and coupling method

Mathematics Subject Classification ID

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

Recommendations

• A pointwise approximation of isolated trees in a random graph
• Poisson approximation of the number of cliques in random intersection graphs
• On the isolated vertices and connectivity in random intersection graphs
• Compound Poisson approximations of subgraph counts in random graphs
• Poisson approximation of counts of induced subgraphs in random intersection graphs

Cited in

(7)

• The number of triangles in random intersection graphs
• scientific article; zbMATH DE number 5310725 (Why is no real title available?)
• The bound on Poisson approximation for the number of edges in a random intersection graph on the surface of a sphere
• POISSON APPROXIMATION FOR THE NUMBER OF OPIES OF A FIXED GRAPH IN A RANDOM d-REGULAR GRAPH
• Poisson approximation of the number of cliques in random intersection graphs
• A pointwise approximation of isolated trees in a random graph
• Inhomogeneous random graphs, isolated vertices, and Poisson approximation

This page was built for publication: Poisson approximation for the number of isolated trees in a random intersection graph

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