A matrix perturbation view of the small word phenomenon

SIAM Review

Volumn 49, Issue 1, 2007, Pages 91-108

  Higham, Desmond J ^a  

^a UNIVERSITY OF STRATHCLYDE   (United Kingdom)

Author keywords

Google; Markov chain; Matrix perturbation; Mean hitting time; Optional sampling theorem; Partially random graph; Random walk; Sherman Morrison formula; Teleporting; Web search engine

Indexed keywords

ASYMPTOTIC ANALYSIS; MARKOV PROCESSES; PERTURBATION TECHNIQUES; RANDOM PROCESSES; SEARCH ENGINES; WEBSITES;

MATRIX PERTURBATION; MEAN HITTING TIME; SHERMAN-MORRISON FORMULA;

MATRIX ALGEBRA;

EID: 33847632050     PISSN: 00361445     EISSN: None     Source Type: Journal    
DOI: 10.1137/060664987     Document Type: Article

References (36)

1. U. Alon. An Introduction to Systems Biology, Chapman & Hall/CRC, Boca Raton, FL, 2006.
2. A. D. Barbour and G. Reinert. Small worlds. Random Structures Algorithms, 19 (2001), pp. 54-74.
3. E. Behrends, Introduction to Markov Chains with Special Emphasis on Rapid Mixing, Vieweg, Braunschweig. 2000.
4. H. C. Berg, Random Walks in Biology. Princeton University Press, Princeton, NJ, 1983.
5. H. Caswell, Matrix Population Models. 2nd ed.. Sinauer Associates, Sunderland, MA, 2001.
6. M. Catral. M. Neumann. and J. Xu. Matrix analysis of a Markov chain small-world model, Linear Algebra Appl., 409 (2005). pp. 126-146.
7. J. W. Demmel. Applied Numerical Linear Algebra. SIAM, Philadelphia, 1997.
8. P. M. Gleiss. P. F. Stadler. A. Wagner. and D. A. Fell. Relevant cycles in chemical reaction networks, Adv. Complex Systenis, 4 (2001). pp. 207-226.
9. P. Grindrod, Range-dependent random graphs and their application to modeling large small-world proteome datasets. Phys. Rev. E. 66 (2002). article 066702.
10. P. Grindrod, Modeling protcome networks with range-dependent graphs, Amer. J. Pharmaco Genomics, 3 (2003) pp. 1-4.
11. D. J. Higham. Spectral reordering of a range-dependent weighted random graph, IMA J. Numer. Anal., 25 (2005). pp. 443-457.
12. D. J. Higham, Greedy pathlengths and small world graphs. Linear Algebra Appl.. 416 (2006), pp. 745-758.
13. N. J. Higham, Accuracy and Stability of Numerical Algorithms, 2nd ed., SIAM, Philadelphia, 2002.
14. S. D. Kamvar. T. H. Haveliwala. C. D. Manning. and G. H. Golub, Extrapolation methods for accelerating pagerank computations, in Proceedings of the 12th International World Wide Web Conference. Budapest. Hungary. 2003.
15. S. Karlin and H. M. Taylor. A First Course, in Stochastic Processes, 2nd ed., Academic Press, San Diego. 1975.
16. J. Kleinberg, Navigation in a small world. Nature, 406 (2000), p. 845.
17. X. Liu, G. Strang, And S. Ott. Localized eigenvectors from, widely spaced matrix modifications, SIAM J. Discrete Math.. 16 (2003). pp. 479-498.
18. C. Moler. The world's largest matrix computation,, MATLAB News and Notes, October 2002.
19. J. M. Montoya and R. V. Solé, Small world, patterns in food webs, J. Theoret. Biology, 214 (2002), pp. 405-412.
20. R. Motwani And P. Raghavan. Randomized Algorithms. Cambridge University Press, Cambridge, UK, 1995.
21. J. L. Morrison. B. Breitling. D. J. Higham. and D. R. Gilbert, GeneRank: Using search engine technology for the analysis of microarray experiments, BMC Bioinform., 6 (2005); available online from http://www.biomedcentral.com/1471-2105/6/233.
22. J. L. Morrison, R. Breitling, D. J. Higham, and D. R. Gilbert, A lock-and-key model for protein-protein interactions, Bioinformatics, 22 (2006), pp. 2012-2019.
23. M. E. J. Newman, The structure of scientific collaboration networks, Proc. Natl. Acad. Sci. USA, 98 (2001), pp. 404-409.
24. M. E. J. Newman, The structure and function of networks, Comput. Phys. Comm., 147 (2002), pp. 40-45.
25. M. E. J. Newman, The structure and function of complex networks, SIAM Rev., 45 (2003), pp. 167-256.
26. M. E. J. Newman, C. Moore, and D. J. Watts, Mean-field solution of the small-world network model, Phys. Rev. Lett., 84 (2000), pp. 3201-3204.
27. J. R. Norris, Markov Chains, Cambridge University Press, Cambridge, UK, 1997.
28. J. M. Ortega, Numerical Analysis: A Second Course, SIAM, Philadelphia, 1990.
29. N. Pržulj, D. G. Corneil, and I. Jurisica, Modeling interactome: Scale-free or geometric?, Bioinform., 20 (2004), pp. 3508-3515.
30. N. Pržulj and D. J. Higham, Modelling protein-protein interaction networks via a stickiness index, J. Roy. Soc. Interface, 3 (2006), pp. 711-716.
31. E. De Silva and M. P. H. Stumpf, Complex networks and simple models in biology, J. Roy. Soc. Interface, 2 (2005), pp. 419-430.
32. S. H. Strogatz, Exploring complex networks, Nature, 410 (2001), pp. 268-276.
33. A. Thomas, R. Cannings, N. A. M. Monk, and C. Cannings, On the structure of protein-protein interaction networks, Biochem. Sec. Trans., 31 (2003), pp. 1491-1496.
34. A. Wagner and D. A. Fell, The small world inside large metabolic networks, Proc. Roy. Soc. London Ser. B., 268 (2001), pp. 1803-1810.
35. D. J. Watts, Small Worlds: The Dynamics of Networks between Order and Randomness, Princeton University Press, Princeton, NJ, 1999.
36. D. J. Watts and S. H. Strogatz, Collective dynamics of "small-world" networks, Nature, 393 (1998), pp. 440-442.