Sharp threshold functions for random intersection graphs via a coupling method

Electronic Journal of Combinatorics

Volumn 18, Issue 1, 2011, Pages

  Rybarczyk, Katarzyna ^a  

^a ADAM MICKIEWICZ UNIVERSITY   (Poland)

Author keywords

Connectivity; Coupling; Hamilton cycle; Perfect matching; Random intersection graphs; Threshold functions

Indexed keywords

EID: 79951706624     PISSN: None     EISSN: 10778926     Source Type: Journal    
DOI: 10.37236/523     Document Type: Article

References (18)

1. Barbour, A. D., Holst, L. and Janson, S. Poisson Approximation. Oxford University Press, 1992
2. Behrisch, M. Component evolution in random intersection graphs. Electron. J. Combin. 14, R17, 2007.
3. Bloznelis, M., Jaworski, J. and Rybarczyk, K. Component evolution in a secure wireless sensor networks. Networks 53, 19-26, 2009.
4. Bollobás, B. The evolution of sparse graphs, Graph Theory and Combinatorics (Cambridge 1983), 35-57, Academic Press, 1984.
5. Bollobás, B. and Thomason, A. Random graphs of small order. Random Graphs '83, Proceedings, Poznań, 1983, 47-97, 1985.
6. Efthymiou, C. and Spirakis, P. G. On the existence of hamiltonian cycles in random intersection graphs. In: Automata, Languages and Programming 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, 690-701, 2005.
7. Erdó́s P. and Réenyi, A. On random graphs I. Publ. Math. Debrecen 6, 290-297, 1959.
8. Fill, J. A., Scheinerman, E. R. and Singer-Cohen, K. B. Random intersec- tion graphs when m=ω (n): An equivalence theorem relating the evolution of th G(n,m, p) and G(n, p) models. Random Structures Algorithms 16, 156-176, 2000.
9. Godehardt, E. and Jaworski, J. Two models of random intersection graphs for classification. In: M. Schwaiger, O. Opitz, (eds.): Exploratory Data Analysis in Empirical Research, (Proceedings of the 25th Annual Conference of the Gesellschaft f̈ur Klassifikation e.V., University of Munich, 2001). Springer, 67-81, 2002.
10. Janson, S., Luczak, T. and Ruciński, A. Random Graphs. Wiley-Interscience, New York, 2000.
11. Karoński, M., Scheinerman, E.R. and Singer-Cohen, K.B. On random intersection graphs: the subgraph problem. Combin. Probab. Comput. 8, 131-159, 1999.
12. Komlós, J. and Szeméredi, E. Limit distributions for the existence of Hamilton cycles in a random graph. Discrete Math. 43, 55-63, 1983.
13. Lagerås, A. N. and Lindholm, M. Electron. J. Combin. 15 (1), N10, 2008.
14. Penrose, M. Random Geometric Graphs. Oxford University Press, 2003.
15. Rybarczyk, K. Equivalence of a random intersection graph and G(n, p). Random Structures and Algorithms 38 (1-2), 205-234, 2011.
16. Rybarczyk, K. and Stark, D. Poisson approximation of the number of cliques in random intersection graphs. Journal of Applied Probability 47 (3), 826-840, 2010.
17. Singer-Cohen, K. B. Random intersection graphs. PhD thesis, Department of Mathematical Sciences, The Johns Hopkins University, 1995.
18. Stark, D. The vertex degree distribution of random intersection graphs. Random Structures and Algorithms 24, 249-258, 2004.