Random dot product graph models for social networks

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

Volumn 4863 LNCS, Issue , 2007, Pages 138-149

  Young, Stephen J ^a   Scheinerman, Edward R ^b  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b JOHNS HOPKINS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; GRAPH THEORY; MATHEMATICAL MODELS; RANDOM PROCESSES;

DEGREE DISTRIBUTION; GEOMETRIC SENSES; RANDOM GRAPH MODELS;

TELECOMMUNICATION NETWORKS;

EID: 38149032555     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77004-6_11     Document Type: Conference Paper

References (27)

1. Kraetzl, M., Nickel, C., Scheinerman, E.R.: Random dot product graphs: A model for social netowrks. Preliminary Manuscript (2005)
2. Kraetzl, M., Nickel, C., Scheinerman, E.R., Tucker, K.: Random dot product graphs (July 2005), http://www.ipam.ucla.edu/abstract.aspx7tid-5498
3. Albert, R., Barabási, A.L.: Statistical mechanics of complex networks. Rev. Modern Phys. 74(1), 47-97 (2002)
4. th ACM Symposium on the Theory of Computer Science (2005)
5. nd Joint Conference of the IEEE Computer and Communications Societies (2003)
6. Durrett, R.: Random graph dynamics. In: Cambridge Series in Statistical and Probabilistic Mathematics, Cambridge University Press, Cambridge (2007)
7. Chung, F., Galas, D.J., Dewey, T.G., Lu, L.: Duplication models for biological networks. Journal of Computational Biology (2003)
8. th ACM SIGMOD-SIGACTSIGART Symposium on Principles of Database Systems, pp. 1-10. ACM Press, New York (2000)
9. Bornholdt, S., Schuster, H.G. (eds.): Handbook of graphs and networks. From the genome to the internet. Wiley-VCH, Weinheim (2003)
10. Newman, M.E.J.: Assortative mixing in networks. Physical Review Letters 89 (2002)
11. Flaxman, A.D., Frieze, A.M., Vera, J.: A geometric preferential attachment model of networks. Internet Math. 3(2), 187-205 (2006)
12. Caldarelli, G., Capocci, A., de Los Rios, P., Muñoz, M.A.: Scale-Free Networks from Varying Vertex Intrinsic Fitness. Physical Review Letters 89(25) (2002)
13. nd ACM Symposium on Theory of Computing, pp. 619-626. ACM Press, New York (2001)
14. Leskovec, J., Kleinberg, J., Faloutsos, C.: Graph evolution: Densification and shrinking diameters. ACM Trans. Knowl. Discov. Data 1(1) (2007)
15. Liben-Nowell, D., Novak, J., Kumar, R., Raghavan, P., Tomkins, A.: Geographic routing in social networks. Proceedings of the National Academy of Sciences 102(33), 11623-1162 (2005)
16. Bollobás, B.: Modern graph theory. In: Bollobás, B. (ed.) Graduate Texts in Mathematics, vol. 184, Springer, New York (1998)
17. Ben-Tal, A., Nemirovski, A.: Lectures on Modern Convex Optimization; Analysis, Algorithms, and Engineering Applications, SIAM, Philadelphia, PA (2001)
18. Hörmnn, W., Leydold, J.: Random-number and random-variate generation: automatic random variate generation for simulation input. In: Winter Simulation Conference, pp. 675-682 (2000)
19. Scheinerman, E.R., Tucker, K.: Exact and asymptotic dot product representations of graphs i: Fundamentals (Submitted, 2007)
20. Scheinerman, E.R., Tucker, K.: Exact and asymptotic dot product representations of graphs ii: Characterization and recognition (Submitted, 2007)
21. Scheinerman, E.R., Tucker, K.: Modelling graphs using dot product representations, (preparation, 2007)
22. Alon, N., Spencer, J.H.: The Probabilistic Method. In: Wiley-Interscience Series in Discrete Mathematics and Optimization, 2nd edn., Wiley-Interscience, New York (2000)
23. Mihail, M., Papadimitriou, C., Saberi, A.: On certain connectivity properties of the internet topology. J. Comput. System Sci. 72(2), 239-251 (2006) (FOCS 2003 Special Issue)
24. Young, S.J.: Sparse random dot product graphs, (preparation, 2007)
25. Milgram, S.: The small world problem. Psychology Today (1967)
26. Milgram, S., Travers, J.: An experimental study of the small world problem. Scciometry 32(4), 425-443 (1969)
27. nd ACM Symposium on the Theory of Computer Science (1999)