Poisson approximation of counts of induced subgraphs in random intersection graphs
From MaRDI portal
Publication:2359960
DOI10.1016/j.disc.2017.04.013zbMath1365.05204arXiv1609.01699OpenAlexW2963923607MaRDI QIDQ2359960
Katarzyna Rybarczyk, Dudley Stark
Publication date: 23 June 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.01699
Random graphs (graph-theoretic aspects) (05C80) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph operations (line graphs, products, etc.) (05C76)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Equivalence of a random intersection graph and G (n ,p )
- Threshold functions for small subgraphs
- On Random Intersection Graphs: The Subgraph Problem
- Poisson Approximation of the Number of Cliques in Random Intersection Graphs
- Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models