Analyzing the small world phenomenon using a hybrid model with local network flow

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

Volumn 3243, Issue , 2004, Pages 19-30

  Andersen, Reid ^a   Chung, Fan ^a   Lu, Lincoln ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH ALGORITHMS;

AVERAGE DISTANCE; CLUSTERING EFFECT; EXTRACTION ALGORITHMS; LOCAL CONNECTIVITY; POWER LAW DEGREE DISTRIBUTION; RANDOM POWER-LAW GRAPHS; REAL-WORLD NETWORKS; SMALL WORLD PHENOMENON;

FLOW GRAPHS;

EID: 35048865310     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30216-2_2     Document Type: Article

References (14)

1. R. Andersen, F. Chung, L. Lu, Modelling the small world phenomenon using local network flow (Preprint)
2. S. Boyles, G. Exoo, On line disjoint paths of bounded length. Discrete Math. 44 (1983)
3. F. Chung and L. Lu, Average distances in random graphs with given expected degree sequences, Proceedings of National Academy of Science, 99 (2002).
4. F. Chung and L. Lu, The small world phenomenon in hybrid power law graphs Lecture Note in Physics special volume on "Complex Network", to appear.
5. P. Erdös and T. Gallai, Gráfok elöírt fokú pontokkal (Graphs with points of prescribed degrees, in Hungarian), Mat. Lapok 11 (1961), 264-274.
6. A. Fabrikant, E. Koutsoupias and C. H. Papadimitriou, Heuristically optimized trade-offs: a new paradigm for power laws in the Internet, STOC 2002.
7. G. W. Flake, R. E. Tarjan, and K. Tsioutsiouliklis, Graph Clustering and Minimum Cut Trees.
8. N. Garg, J. Konemann, Faster and simpler algorithms for multicommodity flow and other fractional packing problems. Technical Report, Max-Planck-Institut fur Informatik, Saarbrucken, Germany (1997).
9. A. Itai, Y. Perl, and Y. Shiloach, The complexity of finding maximum disjoint paths with length constraints, Networks 12 (1982)
10. J. Kleinberg, The small-world phenomenon: An algorithmic perspective, Proc. 32nd ACM Symposium on Theory of Computing, 2000.
11. S. Milgram, The small world problem, Psychology Today, 2 (1967), 60-67.
12. M. Mitzenmacher, A Brief History of Generative Models for Power Law and Lognormal Distributions, Internet Math, 1 (2003), no. 2.
13. S. Plotkin, D. B. Shmoys, and E Tardos, Fast approximation algorithms for fractional packing and covering problems, FOCS 1991, pp. 495-504.
14. D. J. Watts and S. H. Strogatz, Collective dynamics of 'small world' networks, Nature 393, 440-442.