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 and Algorithms

Volumn 16, Issue 2, 2000, Pages 156-176

  Fill, James Allen ^a   Scheinerman, Edward R ^a   Singer Cohen, Karen B ^b  

^a JOHNS HOPKINS UNIVERSITY   (United States)

^b UNIVERSITY OF FLORIDA   (United States)

Author keywords

Intersection graphs; Random graphs; Threshold; Total variation distance

Indexed keywords

EID: 0034391563     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(sici)1098-2418(200003)16:2<156::aid-rsa3>3.0.co;2-h     Document Type: Article

References (10)

1. N. Alon and J. H. Spencer, The probabilistic method, Wiley, New York, 1992.
2. P. Diaconis, Group representations in probability and statistics, Institute of Mathematical Statistics, Haywood, CA, 1988.
3. P. Erdos and A. Rényi, On random graphs I, Publ Math Debrecen 6 (1959), 290-297.
4. P. Erdos and A. Rényi, On the evolution of random graphs, MTA Mat Kut Int Kozl 5 (1960), 17-61.
5. M. Karoński, "Random graphs," Handbook of combinatorics, Vol. 1, R. L. Graham, M. Grötschel, L. Lovász, (Editors), M.I.T. Press, Cambridge, 1995, pp. 351-380.
6. M. Karoński, E. R. Scheinerman, and K. Singer-Cohen, On random intersection graphs: the subgraph problem, Combin Probab Comput 8 (1999), 131-159.
7. T. Łuczak, "On the equivalence of two basic models of random graphs," Random Graphs '87: Proceedings of the 3rd International Seminar on Random Graphs and Probabilistic Methods in Combinatorics, 1990, pp. 151-157.
8. E. Marczewski, Sur deux propriétés des classes d'ensembles, Fund Math 33 (1945), 303-307.
9. E.M. Palmer, Graphical Evolution, Wiley, New York, 1985.
10. K. Singer, Random intersection graphs, Ph.D. dissertation, Department of Mathematical Sciences, The Johns Hopkins University, 1995.