Unravelling small world networks

Journal of Computational and Applied Mathematics

Volumn 158, Issue 1, 2003, Pages 61-74

  Higham, Desmond J ^a  

^a UNIVERSITY OF STRATHCLYDE   (United Kingdom)

Author keywords

Adjacency matrix; Bandwidth; Bioinformatics; Cuthill McKee; Envelope; Genome datasets; Laplacian; Maximum likelihood; Minimum degree; Proteome networks; Random graph; Reordering; Small world phenomenon; Sparse matrix; Two sum

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; INVERSE PROBLEMS; MATHEMATICAL MODELS; MATRIX ALGEBRA; MAXIMUM LIKELIHOOD ESTIMATION;

RANDOM GRAPHS;

GRAPH THEORY;

MATHEMATICAL METHOD;

EID: 0043287109     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-0427(03)00471-0     Document Type: Article

References (28)

1. L. Adamic, The small world web, Proceedings of the European Conference on Digital Libraries, Paris, 1999, pp. 443-452.
2. Altman R.B. Raychaudhuri S. Whole-genome expression analysis: challenges beyond clustering Curr. Opinion Struct. Biol. 11 2001 340-347
3. Barbour A.D. Reinert G. Small worlds Random Struct. Algorithms 19 2001 54-74
4. Barnard S.T. Pothen A. Simon H.D. A spectral algorithm for envelope reduction of sparse matrices Numer. Linear Algebra Appl. 2 1995 317-334
5. Eisen M.B. Spellman P.T. Brown P.O. Botstein D. Cluster analysis and display of genome-wide expression patterns Genetics 95 1998 14863-14868
6. Fuks H. Lawniczak A.T. Performance of data networks with random links Math. Comput. Simulation 51 1999 103-119
7. George A. Pothen A. An analysis of spectral envelope-reduction via quadratic assignment problems SIAM J. Matrix Anal. Appl. 18 1997 706-732
8. Gleiss P.M. Stadler P.F. Wagner A. Fell D.A. Relevant cycles in chemical reaction networks Adv. Complex Systems 4 2001 207-226
9. P. Grindrod, Range-dependent random graphs and their application to modeling large small-world Proteome datasets, Phys. Rev. E 66 (2002) 066702-1-066702-7.
10. Grindrod P. Modeling Proteome networks with range-dependent graphs Amer. J. PharmacoGenomics 3 2003 1-4
11. Hazbun T.R. Fields S. Networking proteins in yeast PNAS 98 2001 4277-4278
12. D.J. Higham, A matrix perturbation view of the small world phenomenon, SIAM J. Matrix Anal. Appl. ( 2003), to appear.
13. D.J. Higham, Greedy pathlengths and small world graphs, Mathematics Research Report 8, University of Strathclyde, 2002.
14. Higham D.J. Higham N.J. MATLAB Guide 2000 SIAM Philadelphia, PA
15. Ito T. Ichiba T. Yoshida O.R.M. Hattori M. Sakaki Y. A comprehensive two-hybrid analysis to explore the yeast protein interactome PNAS 98 2001 4569-4574
16. Jeong H. Mason S.P. Barábasi A.-L. Oltval Z.N. Lethality and centrality in protein networks Nature 411 2001 41-42
17. Jeong H. Tombor B. Albert R. Oltval Z. Barabasi A.-L. The large scale organisation of metabolic networks Nature 407 2000 651-654
18. Kleinberg J. Navigation in a small world Nature 406 2000 845
19. Kumfert G. Pothen A. Two improved algorithms for envelope and wavefront reduction BIT 35 1997 559-590
20. Newman M.E.J. The structure of scientific collaboration networks Proc. Nat. Acad. Sci. 98 2001 404-409
21. Newman M.E.J. Moore C. Watts D.J. Mean-field solution of the small-world network model Phys. Rev. Lett. 84 2000 3201-3204
22. Reid J. Duff I. Erisman A. Direct Methods for Sparse Matrices 1986 Oxford University Press Oxford
23. Shi J. Malik J. Normalized cuts and image segmentation IEEE Trans. Pattern Anal. Mach. Intell. 22 2000 888-905
24. Strogatz S.H. Exploring complex networks Nature 410 2001 268-276
25. Van Driessche R. Roose D. An improved spectral bisection algorithm and its application to dynamic load balancing Parallel Comput. 21 1995 29-48
26. Wagner A. Fell D.A. The small world inside large metabolic networks Proc. Roy. Soc. London Ser. B 268 2001 1803-1810
27. Watts D.J. Small Worlds: The Dynamics of Networks between Order and Randomness 1999 Princeton University Press Princeton, NJ
28. Watts D.J. Strogatz S.H. Collective dynamics of 'small-world' networks Nature 393 1998 440-442