Equivalence of a random intersection graph and G (n ,p )
From MaRDI portal
Publication:3068767
DOI10.1002/RSA.20356zbMath1223.05282arXiv0910.5311OpenAlexW3125177404MaRDI QIDQ3068767
Publication date: 17 January 2011
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0910.5311
Random graphs (graph-theoretic aspects) (05C80) Structural characterization of families of graphs (05C75)
Related Items (14)
Poisson approximation of counts of induced subgraphs in random intersection graphs ⋮ Maximum cliques in graphs with small intersection number and random intersection graphs ⋮ Random subcube intersection graphs. I: Cliques and covering ⋮ Constructions of independent sets in random intersection graphs ⋮ On Some Combinatorial Properties of Random Intersection Graphs ⋮ The largest component in critical random intersection graphs ⋮ MAX CUT in weighted random intersection graphs and discrepancy of sparse random set systems ⋮ Selected combinatorial problems through the prism of random intersection graphs models ⋮ A spectral algorithm for finding maximum cliques in dense random intersection graphs ⋮ Phase transitions for detecting latent geometry in random graphs ⋮ On the chromatic number of non-sparse random intersection graphs ⋮ The chromatic number of random intersection graphs ⋮ The coupling method for inhomogeneous random intersection graphs. ⋮ Diameter, connectivity, and phase transition of the uniform random intersection graph
Cites Work
- Degree distribution of a typical vertex in a general random intersection graph
- RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING
- Perfect matchings in random uniform hypergraphs
- Poisson Approximation of the Number of Cliques in Random Intersection Graphs
- Component evolution in a secure wireless sensor network
This page was built for publication: Equivalence of a random intersection graph and G (n ,p )
