1 |
Watts, D. J. and Strogatz, S. H. (1998). Collective dynamics of small world networks, Nature, 393, 440-442.
DOI
ScienceOn
|
2 |
Leskovec, J., Kleinberg, J. and Faloutsos, C. (2005). Graphs over time: densification laws, shrinking diameters and possible explanations, KDD '05: Proceeding of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, 177-187.
|
3 |
Newman, M. E. J. (2004). Fast algorithm for detecting community structure in networks, Physical Review, E 69, 066133.
DOI
|
4 |
Travers, J. and Milgram, S. (1969). An experimental study of the small world problem, Sociometry, 32, 425-443.
DOI
ScienceOn
|
5 |
Wasserman, S. and Faust, K. (1994). Social Network Analysis: Methods and Applications, Cambridge University Press, New York.
|
6 |
Erdos, P. and Renyi, A. (1959). On random graphs I, Publicationes Mathematicae Debrecen, 6, 290-297.
|
7 |
Barabasi, A.-L. and Albert, R. (1999). Emergence of scaling in random networks, Science, 286, 509-512.
DOI
ScienceOn
|