The vertex degree distribution of random intersection graphs

Random Structures and Algorithms

Volumn 24, Issue 3, 2004, Pages 249-258

  Stark, Dudley ^a  

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 11144302612     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.20005     Document Type: Article

References (8)

1. J. A. Fill, E. R. Scheinerman, and K. B. Singer-Cohen, Random intersection graphs when m = ω(n): An equivalence theorem relating the evolution of the G(n, m, p) and G(n, p) models, Random Structures Algorithms 16 (2000), 156-176.
2. S. Janson, T. Luczak, and A. Ruciński, Random graphs, Wiley-Interscience, New York.
3. J. Galambos, e-mail communication.
4. M. Karoński, E. R. Scheinerman, and K. B. Singer-Cohen, On random intersection graphs: the subgraph problem, Combin Probab Comput 8 (1999), 131-159.
5. M. E. J. Newman, S. H. Strogatz, and D. J. Watts, Random graphs with arbitrary degree distributions and their applications, Phys Rev E 64(3) (2001), 026118.
6. K. B. Singer, Random intersection graphs, Dissertation, Johns Hopkins University, Baltimore, MD, 1995.
7. L. Takács, On the method of inclusion and exclusion, J Amer Statist Assoc 62 (1967), 102-113.
8. H. S. Wilf, Generating functionology, Academic, New York.