The largest component in an inhomogeneous random intersection graph with clustering

Electronic Journal of Combinatorics

Volumn 17, Issue 1, 2010, Pages 1-17

  Bloznelis, Mindaugas ^a  

^a VILNIUS UNIVERSITY   (Lithuania)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77955617281     PISSN: None     EISSN: 10778926     Source Type: Journal    
DOI: 10.37236/382     Document Type: Article

References (16)

1. A.D. Barbour, L. Holst, and S. Janson, Poisson Approximation, Oxford University Press, Oxford, 1992.
2. M. Behrisch, Component evolution in random intersection graphs, The Electronic Journal of Combinatorics 14(1) (2007).
3. M. Bloznelis, Degree distribution of a typical vertex in a general random intersection graph, Lithuanian Mathematical Journal 48 (2008), 38-45.
4. M. Bloznelis, Component evolution in general random intersection graphs. SIAM J. Discrete Math. 24 (2010), 639-654.
5. M. Bloznelis, A random intersection digraph. Indegree and outdegree distributions, Discrete Mathematics 310 (2010), 2560-2566.
6. B. Bollobas, S. Janson, and O. Riordan, The phase transition in inhomogeneous random graphs, Random Structures Algorithms 31 (2007), 3-122.
7. F. Chung and L. Lu, Complex graphs and networks, CBMS regional conference series in mathematics, no 107, American Mathematical Society, Providence, Rhode Island, 2006.
8. M. Deijfen and W. Kets, Random intersection graphs with tunable degree distribution and clustering, Probab. Eng. Inform. Sci. 23 (2009), 661-674.
9. P. Erdos and A. Renyi, On the evolution of random graphs, Publ. Math. Inst. Hungar. Acad. Sci., 5 (1960), 17-61.
10. J. A. Fill, E. R. Scheinerman, K. B. Singer-Cohen, 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 and Algorithms, 16 (2000), 156-176.
11. E. Godehardt and J. Jaworski, Two models of random intersection graphs for classification, in: Studies in Classification, Data Analysis and Knowledge Organization, Springer, Berlin-Heidelberg-New York, 2003, 67-81.
12. J. Jaworski, M. Karonski, and D. Stark, The degree of a typical vertex in generalized random intersection graph models, Discrete Mathematics 306 (2006), 2152-2165.
13. M. Karonski, E. R. Scheinerman, and K.B. Singer-Cohen, On random intersection graphs: The subgraph problem, Combinatorics, Probability and Computing 8 (1999), 131-159.
14. A. N. Lageras and M. Lindholm, A note on the component structure in random intersection graphs with tunable clustering, Electronic Journal of Combinatorics 15(1) (2008).
15. K. B. Singer-Cohen, Random intersection graphs, PhD thesis, Department of Mathematical Sciences, The John Hopkins University, 1995.
16. D. Stark, The vertex degree distribution of random intersection graphs, Random Structures Algorithms 24 (2004), 249-258.