A note on the vertex degree distribution of random intersection graphs
From MaRDI portal
Abstract: We establish the asymptotic degree distribution of the typical vertex of inhomogeneous and passive random intersection graphs under the minimal moment conditions.
Cites work
- A guided tour in random intersection graphs
- Degree and clustering coefficient in sparse random intersection graphs
- Degree distribution of a typical vertex in a general random intersection graph
- Degree distribution of an inhomogeneous random intersection graph
- Degree distributions in general random intersection graphs
- Introduction to Random Graphs
- On Random Intersection Graphs: The Subgraph Problem
- RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING
- The Vertex Degree Distribution of Passive Random Intersection Graph Models
- The degree distribution in random intersection graphs
- The degree of a typical vertex in generalized random intersection graph models
- The vertex degree distribution of random intersection graphs
- Two Models of Random Intersection Graphs and their Applications
Cited in
(4)- Equivalence of a random intersection graph and G (n ,p )
- A random intersection digraph: indegree and outdegree distributions
- Selected Combinatorial Properties of Random Intersection Graphs
- Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models
This page was built for publication: A note on the vertex degree distribution of random intersection graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831318)