Spectral reordering of a range-dependent weighted random graph

D.J. Higham

Research output: Contribution to journalArticle

9 Citations (Scopus)
17 Downloads (Pure)

Abstract

Reordering under a random graph hypothesis can be regarded as an extension of clustering and fits into the general area of data mining. Here, we consider a generalization of Grindrod's model and show how an existing spectral reordering algorithm that has arisen in a number of areas may be interpreted from a maximum likelihood range-dependent random graph viewpoint. Looked at this way, the spectral algorithm, which uses eigenvector information from the graph Laplacian, is found to be automatically tuned to an exponential edge density. The connection is precise for optimal reorderings, but is weaker when approximate reorderings are computed via relaxation. We illustrate the performance of the spectral algorithm in the weighted random graph context and give experimental evidence that it can be successful for other edge densities. We conclude by applying the algorithm to a data set from the biological literature that describes cortical connectivity in the cat brain.
Original languageEnglish
Pages (from-to)443-457
Number of pages14
JournalIMA Journal of Numerical Analysis
Volume25
DOIs
Publication statusPublished - 2005

Keywords

  • bioinformatics
  • cortical connectivity
  • clustering
  • functional magnetic resonance imaging of the brain
  • genome data sets
  • Laplacian
  • maximum likelihood
  • small world networks
  • sparse matrix
  • two-sum

Fingerprint Dive into the research topics of 'Spectral reordering of a range-dependent weighted random graph'. Together they form a unique fingerprint.

Cite this