Poisson Approximation of the Number of Cliques in Random Intersection Graphs

DOI10.1239/JAP/1285335412zbMath1205.60052OpenAlexW1998025836MaRDI QIDQ4933202

Katarzyna Rybarczyk, Dudley Stark

Publication date: 12 October 2010

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1239/jap/1285335412

zbMATH Keywords

Stein's methodPoisson approximationrandom intersection graph

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80)

Related Items (10)

The Asymptotic Normality of the Global Clustering Coefficient in Sparse Random Intersection Graphs ⋮ Poisson approximation of counts of induced subgraphs in random intersection graphs ⋮ Random subcube intersection graphs. I: Cliques and covering ⋮ Unnamed Item ⋮ The number of triangles in random intersection graphs ⋮ A note on hamiltonicity of uniform random intersection graphs ⋮ Large cliques in sparse random intersection graphs ⋮ The coupling method for inhomogeneous random intersection graphs. ⋮ Diameter, connectivity, and phase transition of the uniform random intersection graph ⋮ Equivalence of a random intersection graph and G (n ,p )

Cites Work

• Unnamed Item
• Component evolution in random intersection graphs
• Connectivity of the uniform random intersection graph
• Clustering Coefficients of Random Intersection Graphs
• Epidemics on Random Graphs with Tunable Clustering
• RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING
• On Random Intersection Graphs: The Subgraph Problem
• Random graph models of social networks
• Random Graphs for Statistical Pattern Recognition
• Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models
• Component evolution in a secure wireless sensor network

This page was built for publication: Poisson Approximation of the Number of Cliques in Random Intersection Graphs