Greedy pathlengths and small world graphs

Linear Algebra and Its Applications

Volumn 416, Issue 2-3, 2006, Pages 745-758

  Higham, Desmond J ^a  

^a UNIVERSITY OF STRATHCLYDE   (United Kingdom)

Author keywords

Continuum limit; Differential equation; Finite difference; Greedy algorithm; Markov chain; Mean hitting time; Small world phenomenon

Indexed keywords

DATA PROCESSING; DIFFERENTIAL EQUATIONS; FINITE DIFFERENCE METHOD; GRAPH THEORY; MATHEMATICAL MODELS;

CONTINUUM LIMIT; FINITE DIFFERENCE; GREEDY ALGORITHMS; MARKOV CHAIN; MEAN HITTING TIME; SMALL WORLD PHENOMENON;

ALGORITHMS;

EID: 33646908598     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.laa.2006.01.001     Document Type: Article

References (21)

1. L. Adamic, The small world web, in: Proceedings of the European Conference on Digital Libraries, 1999, pp. 443-452.
2. Barbour A.D., and Reinert G. Small worlds. Random Structures Algorithms 19 (2001) 54-74
3. Bollobás B., and Chung F.R.K. The diameter of a cycle plus a random matching. SIAM J. Disc. Math. 1 (1988) 328-333
4. Fuks H., and Lawniczak A.T. Performance of data networks with random links. Math. Comput. Simulation 51 (1999) 103-119
5. Fuks H., Lawniczak A.T., and Volkov S. Packet delay in models of data networks. ACM Trans. Model. Comput. Simulation 11 (2001) 233-250
6. Gleiss P.M., Stadler P.F., Wagner A., and Fell D.A. Relevant cycles in chemical reaction networks. Adv. Complex Syst. 4 (2001) 207-226
7. Grindrod P. Range-dependent random graphs and their application to modeling large small-world proteome datasets. Phys. Rev. E 66 (2002) 066702-1-066702-7
8. Hairer E., Nørsett S.P., and Wanner G. Solving Ordinary Differential Equations I: Nonstiff problems. second ed. (1993), Springer, Berlin
9. Higham D.J. A matrix perturbation view of the small world phenomenon. SIAM J. Matrix Anal. Appl. 25 (2003) 429-444
10. Jin S., and Bestavros A. Small-world characteristics of internet topologies and implications on multicast scaling. Comput. Networks 50 (2006) 648-666
11. Kleinberg J. Navigation in a small world. Nature 406 (2000) 845
12. J. Kleinberg, The small-world phenomenon: an algorithmic perspective, in: Proceedings of the 32nd ACM Symposium on Theory of Computing, 2000.
13. Milgram S. The small world problem. Psychology Today 2 (1967) 60-67
14. Montoya J.M., and Solé R.V. Small world patterns in food webs. J. Theor. Biol. 214 (2002) 405-412
15. Newman M.E.J. The structure and function of complex networks. SIAM Rev. 45 (2003) 167-256
16. Newman M.E.J., Moore C., and Watts D.J. Mean-field solution of the small-world network model. Phys. Rev. Lett. 84 (2000) 3201-3204
17. Norris J.R. Markov Chains (1997), Cambridge University Press
18. Strogatz S.H. Exploring complex networks. Nature 410 (2001) 268-276
19. Watts D.J. A simple model of global cascades on random networks. Proc. Natl. Acad. Sci. USA 99 (2002) 5751-6450
20. Watts D.J., Dodds P.S., and Newman M.E.J. Identity and search in social networks. Science 296 (2002) 1302-1305
21. Watts D.J., and Strogatz S.H. Collective dynamics of 'small-world' networks. Nature 393 (1998) 440-442