Abstract
Randomly generated graphs with power law degree distribution are typically used to model large real-world networks. These graphs have small average distance. However, the small world phenomenon includes both small average distance and the clustering effect, which is not possessed by random graphs. Here we use a hybrid model which combines a global graph (a random power law graph) with a local graph (a graph with high local connectivity defined by network flow). We present an efficient algorithm which extracts a local graph from a given realistic network. We show that the hybrid model is robust in the sense that for any graph generated by the hybrid model, the extraction algorithm approximately recovers the local graph.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Andersen, R., Chung, F., Lu, L.: Modelling the small world phenomenon using local network flow (Preprint)
Boyles, S., Exoo, G.: On line disjoint paths of bounded length. Discrete Math. 44 (1983)
Chung, F., Lu, L.: Average distances in random graphs with given expected degree sequences. Proceedings of National Academy of Science 99 (2002)
Chung, F., Lu, L.: The small world phenomenon in hybrid power law graphs. Lecture Note in Physics, special volume on Complex Network (to appear)
Erdős, P., Gallai, T.: Gráfok előírt fokú pontokkal (Graphs with points of prescribed degrees, in Hungarian). Mat. Lapok 11, 264–274 (1961)
Fabrikant, A., Koutsoupias, E., Papadimitriou, C.H.: Heuristically optimized trade-offs: a new paradigm for power laws in the Internet. In: STOC 2002 (2002)
Flake, G.W., Tarjan, R.E., Tsioutsiouliklis, K.: Graph Clustering and Minimum Cut Trees
Garg, N., Konemann, J.: Faster and simpler algorithms for multicommodity flow and other fractional packing problems. Technical Report, Max-Planck-Institut fur Informatik, Saarbrucken, Germany (1997)
Itai, A., Perl, Y., Shiloach, Y.: The complexity of finding maximum disjoint paths with length constraints. Networks 12 (1982)
Kleinberg, J.: The small-world phenomenon: An algorithmic perspective. In: Proc. 32nd ACM Symposium on Theory of Computing (2000)
Milgram, S.: The small world problem. Psychology Today 2, 60–67 (1967)
Mitzenmacher, M.: A Brief History of Generative Models for Power Law and Lognormal Distributions. Internet Math. 1(2) (2003)
Plotkin, S., Shmoys, D.B., Tardos, E.: Fast approximation algorithms for fractional packing and covering problems. In: FOCS 1991, pp. 495–504 (1991)
Watts, D.J., Strogatz, S.H.: Collective dynamics of ‘small world’ networks. Nature 393, 440–442
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Andersen, R., Chung, F., Lu, L. (2004). Analyzing the Small World Phenomenon Using a Hybrid Model with Local Network Flow (Extended Abstract). In: Leonardi, S. (eds) Algorithms and Models for the Web-Graph. WAW 2004. Lecture Notes in Computer Science, vol 3243. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30216-2_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-30216-2_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23427-2
Online ISBN: 978-3-540-30216-2
eBook Packages: Springer Book Archive