Component evolution in random intersection graphs

Electronic Journal of Combinatorics

Volumn 14, Issue 1 R, 2007, Pages 1-12

  Behrisch, Michael ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33846653768     PISSN: None     EISSN: 10778926     Source Type: Journal    
DOI: 10.37236/935     Document Type: Article

References (15)

1. K. B. Athreya and A. N. Vidyashankar. Branching processes. Technical report, University of Georgia - Department of Statistics, 1999.
2. M. Behrisch and A. Taraz. Efficiently covering complex networks with cliques of similar vertices. Theoretical Computer Science, 2005. to appear.
3. M. Behrisch, A. Taraz, and M. Ueckerdt. Colouring random intersection graphs and complex networks. Preprint, December 2005.
4. B. Bollobás and O. Riordan. Slow emergence of the giant component in the growing m-out graph, to appear in Random Structures and Algorithms.
5. F. Chung and L. Lu. Connected components in random graphs with given expected degree sequences. Annals of Combinatorics, 6:125-145, 2002 .
6. P. Erdos and A. Rényi. On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci., 5:17-61, 1960.
7. J. A. Fill, E. R. Scheinerman, and K. B. Singer-Cohen. Random intersection graphs when m = w(n): An equivalence theorem relating the evolution of the G(n, m, p) and G(n, p) models. Random Structures and Algorithms, 16(2):156-176, March 2000.
8. E. Godehardt and J. Jaworski. Two models of random intersection graphs and their applications. Electronic Notes in Discrete Mathematics, 10, 2001.
9. J.-L. Guillaume and M. Latapy. Bipartite structure of all complex networks. Information Processing Letters, 90:215-221, 2004.
10. S. Janson, T. Łuczak, and A. Ruciński. Random Graphs. John Wiley & Sons, 2000.
11. M. Karoński, E. R. Scheinerman, and K. B. Singer-Cohen. On random intersection graphs: The subgraph problem. Combinatorics, Probability and Computing, 8:131-159, 1999.
12. M. E. J. Newman, S. H. Strogatz, and D. J. Watts. Random graphs with arbitrary degree distributions and their applications. Physical Review E, 64, 2001.
13. K. B. Singer. Random Intersection Graphs. PhD thesis, John Hopkins University, Baltimore, Maryland, 1995.
14. D. Stark. The vertex degree distribution of random intersection graphs. Random Structures and Algorithms, 24(3):249-258, May 2004.
15. M. Ueckerdt. Färben von zufälligen Schnittgraphen. Diploma thesis, Humboldt-Universität zu Berlin, 2005.