论文信息 - Random intersection graphs when m= w (n): an equivalence theorem relating the evolution of the G ( n, m, p ) and G ( n,P /italic>) models

Random intersection graphs when m= w (n): an equivalence theorem relating the evolution of the G ( n, m, p ) and G ( n,P /italic>) models

When the random intersection graph G(n, m, p) proposed by Karonski, Scheinerman, and Singer-Cohen [Combin Probab Comput 8 (1999), 131–159] is compared with the independent-edge G(n, p), the evolutions are different under some values of m and equivalent under others. In particular, when m=nα and α>6, the total variation distance between the graph random variables has limit 0. ©2000 John Wiley & Sons, Inc. Random Struct. Alg., 16, 156–176, 2000

James Allen Fill | Edward R. Scheinerman | Karen B. Singer-Cohen | J. A. Fill | E. Scheinerman

[1] Béla Bollobás,et al. Random Graphs , 1985 .

[2] Edward R. Scheinerman,et al. On Random Intersection Graphs: The Subgraph Problem , 1999, Combinatorics, Probability and Computing.

[3] M. Karonski,et al. Random graphs , 1996 .

[4] B. Bollobás. The evolution of random graphs , 1984 .

[5] P. Diaconis. Group representations in probability and statistics , 1988 .

[6] Edward Szpilrajn-Marczewski. Sur deux propriétés des classes d'ensembles , 1945 .

[7] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.