Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models
DOI10.1002/(SICI)1098-2418(200003)16:2%3C156::AID-RSA3%3E3.0.CO;2-HzbMATH Open0951.05096OpenAlexW2031211633MaRDI QIDQ4948019FDOQ4948019
Authors: James Allen Fill, Karen B. Singer-Cohen, Edward Scheinerman 
Publication date: 13 December 2000
Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(200003)16:2%3C156::aid-rsa3%3E3.0.co;2-h
Recommendations
- Equivalence of a random intersection graph and G (n ,p )
- scientific article; zbMATH DE number 17680
- On Some Combinatorial Properties of Random Intersection Graphs
- Selected combinatorial problems through the prism of random intersection graphs models
- On the equivalence between random graph models
- Asymptotic equivalence and contiguity of some random graphs
- A note on the vertex degree distribution of random intersection graphs
- Hyperbolicity, degeneracy, and expansion of random intersection graphs
- Selected Combinatorial Properties of Random Intersection Graphs
Random graphs (graph-theoretic aspects) (05C80) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Cites Work
Cited In (35)
- The number of triangles in random intersection graphs
- Expander properties and the cover time of random intersection graphs
- Equivalence of a random intersection graph and G (n ,p )
- Colouring Non-sparse Random Intersection Graphs
- A random intersection digraph: indegree and outdegree distributions
- Selected Combinatorial Properties of Random Intersection Graphs
- Connectivity of Poissonian inhomogeneous random multigraphs
- The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs
- Efficiently covering complex networks with cliques of similar vertices
- On Some Combinatorial Properties of Random Intersection Graphs
- On the complexity of the herding attack and some related attacks on hash functions
- MAX CUT in weighted random intersection graphs and discrepancy of sparse random set systems
- Poisson approximation of counts of induced subgraphs in random intersection graphs
- Edge exchangeable models for interaction networks
- Central limit theorem for the largest component of random intersection graph
- Constructions of independent sets in random intersection graphs
- Random subcube intersection graphs. I: Cliques and covering
- The degree of a typical vertex in generalized random intersection graph models
- Connectivity of the uniform random intersection graph
- On the equivalence between random graph models
- On the total variation distance between the binomial random graph and the random intersection graph
- Phase transitions for detecting latent geometry in random graphs
- Random intersection graphs with communities
- Epidemics on Random Graphs with Tunable Clustering
- A note on hamiltonicity of uniform random intersection graphs
- Poisson approximation of the number of cliques in random intersection graphs
- Selected combinatorial problems through the prism of random intersection graphs models
- The largest component in critical random intersection graphs
- A spectral algorithm for finding maximum cliques in dense random intersection graphs
- Diameter, connectivity, and phase transition of the uniform random intersection graph
- On the chromatic number of non-sparse random intersection graphs
- The chromatic number of random intersection graphs
- On the isolated vertices and connectivity in random intersection graphs
- Sharp thresholds for Hamiltonicity in random intersection graphs
- The coupling method for inhomogeneous random intersection graphs.
This page was built for publication: Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4948019)
