Distributed routing in small-world networks

Proceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics

Volumn 2006, Issue , 2006, Pages 144-155

  Sandberg, Oskar ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER APPLICATIONS; COMPUTER SIMULATION; INTERFACES (COMPUTER); KNOWLEDGE BASED SYSTEMS; MARKOV PROCESSES; MATHEMATICAL MODELS;

GLOBAL ELEMENTS; MARKOV CHAIN MONTE-CARLO BASED ALGORITHM; REAL WORLD DATA; SMALL-WORLD NETWORKS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33646833463     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972863.14     Document Type: Conference Paper

References (20)

1. A. Abdul-Rahman. The pgp trust model. EDI-Forum: the Journal of Electronic Commerce, 1997.
2. L. Adamic and E. Adar. How to search a social network. Social Networks, 27:187-203, 2005.
3. L. Adamic, R. Lukose, A. Puniyani, and B. Huberman. Search in power-law networks. Physical Review E, 64 (46135), 2001.
4. B. Bollobas and F. Chung. The diameter of a cycle plus a random matching. SIAM Journal on Discrete Mathematics, 1:328-333, 1988.
5. A. Clauset and C. Moore. How do networks become navigable? Preprint, 2003.
6. P. S. Dodds, M. Roby, and D. J. Watts. An experimental study of search in global social networks. Science, 301:827, 2003.
7. M.R. Garey, D.S. Johnson, and L. Stockmeyer. Some simplified np-complete problems. Theory of Computer Science, 1:237-267, 1978.
8. C. Gkantsidis, M. Mihail, and A. Saberi. Random walks in peer-to-peer networks. In INFOCOM, 2004.
9. O. Häggström. Finite Markov Chains and Algorithmic Applications. Number 52 in London Mathematical Society Student Texts. Cambridge University Press, 2002.
10. W.K. Hastings. Monte carlo sampling methods using markov chains and their applications. Biometrika, 57:97-109, 1970.
11. J. Kleinberg. The Small-World Phenomenon: An Algorithmic Perspective. In Proceedings of the 32nd ACM Symposium on Theory of Computing, 2000.
12. J. Kleinberg. Small-world phenomena and the dynamics of information. In Advances in Neural Information Processing Systems (NIPS) 14, 2001.
13. D. Liben-Nowell, J. Novak, R. Kumar, P. Raghavan, and A. Tomkins. Geograph routing in social networks. In Proceedings of the National Academy of Science, volume 102, pages 11623-11628, 2005.
14. C. Martel and V. Nguyen. Analyzing kleinberg's (and other) small-world models. In PODC '04: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, pages 179-188, New York, NY, USA, 2004. ACM Press.
15. S. Milgram. The small world problem. Psychology Today, 1:61, 1961.
16. O. Sandberg and I. Clarke. An evolving model for small world neighbor selection, draft, 2005.
17. D.J. Watts. Small Worlds: The Dynamics of Networks between Order and Randomness. Princeton University Press, 1999.
18. D.J. Watts, P. Dodds, and M. Newman. Identity and search in social networks. Science, 296:1302-1305, 2002.
19. D.J. Watts and S. Strogatz. Collective dynamics of small world networks. Nature, 393:440, 1998.
20. B. Yu and M. Singh. Search in referral network. In Proceedings of AAMAS Workshop on Regulated Agent-Based Social Systems: Theories and Applications, 2002.