Spectral reordering of a range-dependent weighted random graph

IMA Journal of Numerical Analysis

Volumn 25, Issue 3, 2005, Pages 443-457

  Higham, Desmond J ^a  

^a UNIVERSITY OF STRATHCLYDE   (United Kingdom)

Author keywords

Bioinformatics; Clustering; Cortical connectivity; Functional magnetic resonance imaging of the brain; Genome data sets; Laplacian; Maximum likelihood; Small world networks; Sparse matrix; Two sum

Indexed keywords

BIOINFORMATICS; BRAIN; DATA MINING; FUNCTIONAL NEUROIMAGING; GRAPH THEORY; LAPLACE TRANSFORMS; MAGNETIC RESONANCE IMAGING; MATRIX ALGEBRA; MAXIMUM LIKELIHOOD; SMALL-WORLD NETWORKS;

CLUSTERING; CORTICAL CONNECTIVITY; FUNCTIONAL MAGNETIC RESONANCE IMAGING; LAPLACIANS; SPARSE MATRICES; TWO-SUM;

GRAPH ALGORITHMS;

EID: 26644466792     PISSN: 02724979     EISSN: 14643642     Source Type: Journal    
DOI: 10.1093/imanum/dri003     Document Type: Article

References (19)

1. ALTMAN, R. B. & RAYCHAUDHURI, S. (2001) Whole-genome expression analysis: challenges beyond clustering. Curr. Opin. Struct. Biol., 11, 340-347.
2. ATKINS, J. E., BOMAN, E. G. & HENDRICKSON, B. (1998) A spectral algorithm for seriation and the consecutive ones problem. SIAM J. Comput., 28, 297-310.
3. BARABÁSI, A.-L. & OLTVAL, Z. (2004) Network biology: understanding the cell's functional organization. Nat. Rev. Genet., 5, 101-114.
4. BARNARD, S. T., POTHEN, A. & SIMON, H. D. (1995) A spectral algorithm for envelope reduction of sparse matrices. Numer. Linear Algebra Appl., 2, 317-334.
5. CHUANG, J. S. & ROTH, D. (2001) Gene recognition based on DAG shortest paths. Bioinformatics, 1, 1-9.
6. CHUNG, F. (1997) Spectral Graph Theory. Providence, RI: American Mathematical Society.
7. DING, C. H. Q., HE, X., ZHA, H., Gu, M. & SIMON, H. D. (2001) A min-max cut algorithm for graph partitioning and data clustering. Proceedings of the 1st IEEE Conference on Data Mining, pp. 107-114.
8. GRINDROD, P. (2002) Range-dependent random graphs and their application to modeling large small-world proteome datasets. Phys. Rev. E, 66, 0667021-0667027.
9. GRINDROD, P. (2003) Modeling proteome networks with range-dependent graphs. Am. J. Pharmacogenomics, 3, 1-4.
10. HIGHAM, D. J. (2003) Unravelling small world networks. J. Comp. Appl. Math., 158, 61-74.
11. HILGETAG, C. C., BURNS, G. A., O'NEILL, M. A., SCANNELL, J. W. & YOUNG, M. P. (2000) Anatomical connectivity defines the organization of clusters of cortical areas in the macaque monkey and the cat. Philos. Trans. R. Soc. Land. B Biol. Sci., 355, 91-110.
12. HORN, R. A. & JOHNSON, C. R. (1985) Matrix Analysis. Cambridge: Cambridge University Press.
13. Hu, Y. & SCOTT, J. A. (2003) HSLMC73: A Fast Multilevel Fiedler and Profile Reduction Co de, RAL-TR-2003-36. Numerical Analysis Group, Computational Science and Engineering Department, Rutherford Appleton Laboratory.
14. JEONG, H., TOMBOR, B., ALBERT, R., OLTVAL, Z. & BARABÁSI, A.-L. (2000) The large scale organisation of metabolic networks. Nature, 407, 651-654.
15. JOHANSEN-BERG, H., BEHRENS, T. E. J., ROBSON, M. D., DROBNJAK, I., RUSHWORTH, M. F. S., BRADY, J. M., SMITH, S. M., HIGHAM, D. J. & MATTHEWS, P. M. (2004) Changes in connectivity profiles define functionally-distinct regions in human medial frontal cortex, Proc. Nat. Acad. Sciences, 101, 13335-13340.
16. JUVAN, M. & MOHAR, B. (1992) Optimal linear labelings and eigenvalues of graphs. Discrete Appl. Math., 36, 153-168.
17. SHI, J. & MALIK, J. (2000) Normalized cuts and image segmentation. IEEE Trans. PAMI, 22, 888-905.
18. STROGATZ, S. H. (2001) Exploring complex networks. Nature, 410, 268-276.
19. WATTS, D. J. & STROGATZ, S. H. (1998) Collective dynamics of 'small-world' networks. Nature, 393, 440-442.