Poisson approximation of the number of cliques in random intersection graphs

DOI10.1239/JAP/1285335412MaRDI QIDQ4933202zbMATH OpenOpenAlexFDO

Authors 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

Poisson approximationrandom intersection graphStein's method

Mathematics Subject Classification ID

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

Recommendations

• Poisson approximation of counts of induced subgraphs in random intersection graphs
• Poisson approximation for the number of isolated trees in a random intersection graph
• Large cliques in sparse random intersection graphs
• scientific article; zbMATH DE number 5310725
• On the total variation distance between the binomial random graph and the random intersection graph

Cites work

• Clustering Coefficients of Random Intersection Graphs
• Component evolution in a secure wireless sensor network
• Component evolution in random intersection graphs
• Connectivity of the uniform random intersection graph
• Epidemics on Random Graphs with Tunable Clustering
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• 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
• RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING

Cited in

(18)

• Diameter, connectivity, and phase transition of the uniform random intersection graph
• Poisson approximation of counts of induced subgraphs in random intersection graphs
• Poisson approximation for the number of isolated trees in a random intersection graph
• The bound on Poisson approximation for the number of edges in a random intersection graph on the surface of a sphere
• Equivalence of a random intersection graph and G (n ,p )
• scientific article; zbMATH DE number 5863938 (Why is no real title available?)
• Random subcube intersection graphs. I: Cliques and covering
• scientific article; zbMATH DE number 5310725 (Why is no real title available?)
• On the total variation distance between the binomial random graph and the random intersection graph
• Compound Poisson approximations of subgraph counts in random graphs
• Poisson approximation of induced subgraph counts in an inhomogeneous random intersection graph model
• Large cliques in sparse random intersection graphs
• The coupling method for inhomogeneous random intersection graphs.
• POISSON APPROXIMATION FOR THE NUMBER OF OPIES OF A FIXED GRAPH IN A RANDOM d-REGULAR GRAPH
• The Asymptotic Normality of the Global Clustering Coefficient in Sparse Random Intersection Graphs
• The number of triangles in random intersection graphs
• A note on hamiltonicity of uniform random intersection graphs
• Clique and cycle frequencies in a sparse random graph model with overlapping communities

This page was built for publication: Poisson approximation of the number of cliques in random intersection graphs

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