Random intersection graph process

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8305 LNCS, Issue , 2013, Pages 93-105

  Bloznelis, Mindaugas ^a   Karoński, Michał ^b  

^a VILNIUS UNIVERSITY   (Lithuania)

^b ADAM MICKIEWICZ UNIVERSITY   (Poland)

Author keywords

assortativity; clustering; degree distribution; power law; random graph process; random intersection graph

Indexed keywords

ASSORTATIVITY; CLUSTERING; DEGREE DISTRIBUTIONS; POWER LAW; RANDOM GRAPH PROCESS; RANDOM INTERSECTION GRAPHS;

ALGORITHMS; MATHEMATICAL MODELS;

GRAPH THEORY;

EID: 84893111540     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-03536-9_8     Document Type: Conference Paper

References (19)

1. Aiello, W., Bonato, A., Cooper, C., Janssen, J., Prałat, P.: A spatial web graph model with local influence regions. In: Bonato, A., Chung, F.R.K. (eds.) WAW 2007. LNCS, vol. 4863, pp. 96-107. Springer, Heidelberg (2007)
2. Bloznelis, M.: Degree and clustering coefficient in sparse random intersection graphs. The Annals of Applied Probability 23, 1254-1289 (2013)
3. Bloznelis, M., Damarackas, J.: Degree distribution of an inhomogeneous random intersection graph. The Electronic Journal of Combinatorics 20(3), R3 (2013)
4. Bloznelis, M., Jaworski, J., Kurauskas, V.: Assortativity and clustering of sparse random intersection graphs. Electronic Journal of Probability 18, R38 (2013)
5. Bloznelis, M., Kurauskas, V.: Clustering function: a measure of social influence, http://arxiv.org/abs/1207.4941
6. Bloznelis, M., Karoński, M.: Random intersection graph process, http://arxiv.org/abs/1301.5579
7. Deijfen, M., Kets, W.: Random intersection graphs with tunable degree distribution and clustering. Probab. Engrg. Inform. Sci. 23, 661-674 (2009)
8. Foss, S., Korshunov, D., Zachary, S.: An Introduction to Heavy-Tailed and Subexponential Distributions. ACM, New York (2011)
9. Godehardt, E., Jaworski, J.: Two models of random intersection graphs and their applications. Electronic Notes in Discrete Mathematics 10, 129-132 (2001)
10. Godehardt, E., Jaworski, J., Rybarczyk, K.: Clustering coefficients of random intersection graphs. Studies in Classification, Data Analysis and Knowledge Organization, pp. 243-253. Springer, Heidelberg (2012)
11. Guillaume, J.L., Latapy, M.: Bipartite structure of all complex networks. Inform. Process. Lett. 90, 215-221 (2004)
12. Jaworski, J., Karoński, M., Stark, D.: The degree of a typical vertex in generalized random intersection graph models. Discrete Mathematics 306, 2152-2165 (2006)
13. Karoński, M., Scheinerman, E.R., Singer-Cohen, K.B.: On random intersection graphs: The subgraph problem. Combinatorics, Probability and Computing 8, 131-159 (1999)
14. Martin, T., Ball, B., Karrer, B., Newman, M.E.J.: Coauthorship and citation patterns in the Physical Review. Phys. Rev. E 88, 012814 (2013)
15. Newman, M.E.J.: Clustering and preferential attachment in growing networks. Physical Review E 64, 025102 (2001)
16. Newman, M.E.J., Watts, D.J., Strogatz, S.H.: Random graph models of social networks. Proc. Natl. Acad. Sci. USA 99(suppl. 1), 2566-2572 (2002)
17. Stark, D.: The vertex degree distribution of random intersection graphs. Random Structures and Algorithms 24, 249-258 (2004)
18. Steele, J.M.: Le Cam's inequality and Poisson approximations. The American Mathematical Monthly 101, 48-54 (1994)
19. Watts, D.J., Strogatz, S.H.: Collective dynamics of "small- world" networks. Nature 393, 440-442 (1998)