Component evolution in gen eral random intersection graphs

SIAM Journal on Discrete Mathematics

Volumn 24, Issue 2, 2010, Pages 639-654

  Bloznelis, Mindaugas ^a  

^a VILNIUS UNIVERSITY   (Lithuania)

Author keywords

Component evolution; Giant component; Intersection graph; Random graph

Indexed keywords

COMPONENT EVOLUTION; INTERSECTION GRAPH; LARGEST CONNECTED COMPONENT; POISSON BRANCHING; RANDOM GRAPHS; RANDOM INTERSECTION GRAPHS; RANDOM SUBSETS; VERTEX SET;

BIOLOGY; PROBABILITY DISTRIBUTIONS;

GRAPH THEORY;

EID: 77954475546     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/080713756     Document Type: Article

References (24)

1. A.D. BARBOUR, L. HOLST, S. JANSON, Poisson Approximation, Oxford University Press, New York, 1992.
2. M. BEHRISCH, Component evolution in random intersection graphs, Electron. J. Combin., 14 (2007).
3. M. BLOZNELIS, Degree distribution of a typical vertex in a general random intersection graph, Lithuanian Math. J., 48 (2008), pp. 38-45.
4. [4] M. BLOZNELIS, J. JAWORSKI, AND K. RYBARCZYK, Component evolution in a wireless sensor network, Networks, 53 (2009), pp. 19-26.
5. B. BOLLOBÁS, S. JANSON, and O. RIORDAN, The phase transition in inhomogeneous random graphs, Random Structures Algorithms, 31 (2007), pp. 3-122.
6. F. CHUNG AND L. Lu, Complex Graphs and Networks, CBMS Reg. Conf. Ser. Math. 107, AMS, Providence, RI, 2006.
7. F. CHUNG AND L. Lu, The volume of the giant component of a random graph with given expected degrees, SIAM J. Discrete Math., 20 (2006), pp. 395-411.
8. M. DEIJFEN AND W. KETS, Random intersection graphs with tunable degree distribution and clustering, Probab. Engrg. Inform. Sci., 23 (2009), pp. 661-674.
9. R. DI PIETRO, L. V. MANCINI, A. MEI, A. PANCONESI, AND J. RADHAKRISHNAN, How to Design Connected Sensor Networks That Are Provably Secure,Proceedings of the 2nd IEEE International Conference on Security and Privacy for Emerging Areas in Communication Networks (SecureComm 2006), Baltimore, MD, 2006.
10. P. ERDÖS AND A. RÉNYI, On the evolution of random graphs, Publ. Math. Inst. Hungar. Acad. Sci., 5 (1960), pp. 17-61.
11. L. ESCHENAUER AND V. D. GLIGOR, A key-management scheme for distributed sensor networks,Proceedings of the 9th ACM Conference on Computer and Communications Security Washington, DC, 2002, pp. 41-47.
12. E. GODEHARDT AND J. JAWORSKI, Two models of random intersection graphs for classification, Studies in Classification, Data Analysis and Knowledge Organization, Springer, Berlin, Heidelberg, New York, 2003, pp. 67-81.
13. W. HOEFFDING, Probability inequalities for sums of bounded random variables, J. Amer. Statist. Assoc, 58 (1963), pp. 13-30.
14. J. HWANG AND Y. KIM, Revisiting random key pre-distribution schemes for wireless sensor networks, Proceedings of the 2nd ACM Workshop on Security of Ad Hoc and Sensor Networks, SASN 2004, Washington, DC, 2004, pp. 43-52.
15. S. JANSON, The largest component in a subcritical random graph with a power law degree distribution, Ann. Appl. Probab., 18 (2008), pp. 1651-1668.
16. S. JANSON, T. ŁUCZAK, AND A. RUCINŃSKI, Random Graphs, Wiley, New York, 2001.
17. J. JAWORSKI, M. KARONSKI, AND D. STARK, The degree of a typical vertex in generalized random intersection graph models, Discrete Math., 306 (2006), pp. 2152-2165.
18. N. L. JOHNSON, S. KOTZ, AND A. W. KEMP, Univariate Discrete Distributions, Wiley, New York, 1992.
19. O. KALLENBERG, Foundations of Modern Probability, 2nd ed., Springer, New York, 2002.
20. M. KARONSKI, E. R. SCHEINERMAN, AND K. B. SINGER-COHEN, On random intersection graphs: The subgraph problem, Combin. Probab. Comput., 8 (1999), pp. 131-159.
21. K. B. SlNGER-COHEN, Random Intersection Graphs, Ph.D. thesis, Department of Mathematical Sciences, Johns Hopkins University, Baltimore, MD, 1995.
22. B. SÖDERBERG, General formalism for inhomogeneous random graphs, Phys. Rev. E (3), 66 (2002), article 066121.
23. T. SRÓDKA, On approximation of hypergeometric distribution, Zeszyty Naukowe Politechniki Lodzkiej, 10 (1963), pp. 5-17.
24. D. STARK, The vertex degree distribution of random intersection graphs, Random Structures Algorithms, 24 (2004), pp. 249-258.