Equivalence of a random intersection graph and G(n,p)

Random Structures and Algorithms

Volumn 38, Issue 1-2, 2011, Pages 205-234

  Rybarczyk, Katarzyna ^a  

^a ADAM MICKIEWICZ UNIVERSITY   (Poland)

Author keywords

Equivalence; Graph properties; Random intersection graph

Indexed keywords

EID: 78650157327     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20356     Document Type: Article

References (15)

1. A. D. Barbour, L. Holst, S. Janson, Poisson approximation, Oxford University Press, New York, 1992.
2. M. Bloznelis, Degree distribution of a typical vertex in a general random intersection graph, Lithuanian Math J 48 (2008), 38-45.
3. M. Bloznelis, J. Jaworski, K. Rybarczyk, Component evolution in asecure wireless sensor network, Networks 53 (2009), 19-26.
4. B. Bollobás, Random Graphs, Cambridge University Press, Cambridge, 2001.
5. T. Brittom, M. Deijfen, A. N. Lagerås, M. Lindholm, Epidemicson random graphs with tunable clustering, J Appl Probab 45 (2008), 743-756.
6. M. Deijfen, W. Kets, Random intersection graphs with tunabledegree distribution and clustering, Probab Eng Inform Sci 23 (2009), 661-674.
7. J. A. Fill, E. R. Scheinerman, K. B. Singer-Cohen, Randomintersection graphs when m = ω(n): An equivalence theorem relating the evolution of the G(n, m, p) and G(n, p) models, Random Struct Algorithms 16 (2000), 156-176.
8. E. Godehardt, J. Jaworski, Two models of random intersectiongraphs for classification, Studies in classification, data analysis and knowledge organization, O. Opitz, M. Schwaiger (Editors), Vol. 22, Springer-Verlag, Berlin-Heidelberg-New York, 2003, pp. 67-81.
9. S. Janson, T. Łuczak, A. Ruciński, Random Graphs, Wiley-Interscience, New York, 2001.
10. M. Karoński, E. R. Scheinerman, K. B. Singer-Cohen, On randomintersection graphs: The subgraph problem, Combin Probab Comput 8 (1999), 131-159.
11. J. H. Kim, Perfect matchings in random uniform hypergraphs, Random Struct Algorithms 23 (2003), 111-223.
12. T. Łuczak, On the equivalence of two basic models of random graphs, Random graphs 87', M. Karoński, J. Jaworski, A. Ruciński (Editors), Wiley, Chichester, 1990, pp. 151-158.
13. R. Di Pietro, L. V. Mancini, A. Mei, A. Panconesi, J. Radhakrishnan, Sensor networks that are provably resilient, In Proc 2nd IEEE Int Conf Security Privacy Emerging Areas Commun Networks (SecureComm 2006), Baltimore, MD, 2006.
14. K. B. Singer, Random intersection graphs, Ph.D. thesis, Department of Mathematical Sciences, The Johns Hopkins University, 1995.
15. D. Stark, K. Rybarczyk, Poisson approximation of the number of cliques in random intersection graphs, J Appl Probab 47 (2010), 826-840