Degree distribution of a typical vertex in a general random intersection graph
From MaRDI portal
Publication:946799
DOI10.1007/S10986-008-0004-7zbMATH Open1223.05269OpenAlexW2040246814MaRDI QIDQ946799FDOQ946799
Authors: Mindaugas Bloznelis
Publication date: 24 September 2008
Published in: Lithuanian Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10986-008-0004-7
Cites Work
- The phase transition in inhomogeneous random graphs
- On Random Intersection Graphs: The Subgraph Problem
- Title not available (Why is that?)
- The vertex degree distribution of random intersection graphs
- The degree of a typical vertex in generalized random intersection graph models
- RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING
Cited In (12)
- On local weak limit and subgraph counts for sparse random graphs
- Degree distribution of an inhomogeneous random intersection graph
- Equivalence of a random intersection graph and G (n ,p )
- Title not available (Why is that?)
- A random intersection digraph: indegree and outdegree distributions
- Selected Combinatorial Properties of Random Intersection Graphs
- A note on the vertex degree distribution of random intersection graphs
- Degree and clustering coefficient in sparse random intersection graphs
- Constructions of independent sets in random intersection graphs
- Large cliques in sparse random intersection graphs
- On the independence number and Hamiltonicity of uniform random intersection graphs
- Random key predistribution for wireless sensor networks using deployment knowledge
This page was built for publication: Degree distribution of a typical vertex in a general random intersection graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q946799)