Poisson approximation of the number of cliques in random intersection graphs

Journal of Applied Probability

Volumn 47, Issue 3, 2010, Pages 826-840

  Rybarczyk, Katarzyna ^a   Stark, Dudley ^b  

^a ADAM MICKIEWICZ UNIVERSITY   (Poland)

^b QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Poisson approximation; Random intersection graph; Stein's method

Indexed keywords

EID: 78650133937     PISSN: 00219002     EISSN: None     Source Type: Journal    
DOI: 10.1239/jap/1285335412     Document Type: Article

References (16)

1. Behrisch, M. (2007). Component evolution in random intersection graphs. Electron. J. Combinatorics 14, R17, 12pp.
2. Blackburn, S. R. and Gerke, S. (2009). Connectivity of the uniform random intersection graph. Discrete Math. 309, 5130-5140.
3. Blanchard, Ph., Krueger, A., Krueger, T. and Martin, P. (2005). The epidemics of corruption. Preprint. Available at http://arxiv.org/abs/physics/ 0505031v1.
4. Bloznelis, M., Jaworski, J. and Rybarczyk, K. (2009). Component evolution in a secure wireless sensor network. Networks 53, 19-26.
5. Britton, T., Deijfen, M., Lagerås, A. N. and Lindholm, M. (2008). Epidemics on random graphs with tunable clustering. J. Appl Prob. 45, 743-756.
6. Deijfen,M. and Kets,W. (2009). Random intersection graphs with tunable degree distribution and clustering. Prob. Eng. Inf. Sci. 23, 661-674.
7. Di Pietro, R. et al. (2006). Sensor networks that are provably resilient. In Proc. IEEE Internat. Conf. on Security and Privacy in Communication Networks (SECURECOMM 2006), Baltimore.
8. Fill, J. A., Scheinerman, E. R. and Singer-Cohen, K. B. (2000). 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 Algorithms 16, 156-176.
9. Godehardt, E. and Jaworski, J. (2002). Two models of random intersection graphs for classification. In Exploratory Data Analysis in Empirical Research, eds O. Opitz and M. Schwaiger, Springer, Berlin, pp. 67-81.
10. Godehardt, E., Jaworski, J. and Rybarczyk, K. (2007). Random intersection graphs and classification. In Advances in Data Analysis, eds R. Decker and H.-J. Lenz, Springer, Berlin, pp. 67-74.
11. Godehardt, E., Jaworski, J. and Rybarczyk, K. (2010). Isolated vertices in random intersection graphs. In Advances in Data Analysis, Data Handling and Business Intelligence, eds A. Fink et al., Springer, Berlin, pp. 135-145.
12. Janson, S., Łuczak T. and Ruciński, A. (2000). Random Graphs.Wiley-Interscience, NewYork.
13. Karoński, M., Scheinerman, E. R. and Singer-Cohen, K. B. (1999). On random intersection graphs: the subgraph problem. Combinatorics Prob. Comput. 8, 131-159. (Pubitemid 129640074)
14. Marchette, D. J. (2004). Random Graphs for Statistical Pattern Recognition. JohnWiley, Hoboken, NJ.
15. Newman,M. E. J., Strogatz, S. H. andWatts, D. J. (2001). Random graphs with arbitrary degree distributions and their applications. Phys. Rev. E 64, 026118.
16. Newman,M. E. J.,Watts, D. J. and Strogatz, S. H. (2002). Random graph models of social networks. Proc. Nat. Acad. Sci. USA 99, 2566-2572. (Pubitemid 34165067)