Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-16T19:01:52.275Z Has data issue: false hasContentIssue false

Discovering bipartite substructure in directed networks

Published online by Cambridge University Press:  01 February 2011

Alan Taylor
Affiliation:
Department of Mathematics and Statistics, University of Strathclyde, Glasgow, G1 1XH, United Kingdom (email: ta.atay@maths.strath.ac.uk)
J. Keith Vass
Affiliation:
Translational Medical Research Collaboration, The Sir James Black Centre, University of Dundee, Dundee, DD1 5EH, United Kingdom (email: j.k.vass@dundee.ac.uk)
Desmond J. Higham
Affiliation:
Department of Mathematics and Statistics, University of Strathclyde, Glasgow, G1 1XH, United Kingdom (email: djh@maths.strath.ac.uk)

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Bipartivity is an important network concept that can be applied to nodes, edges and communities. Here we focus on directed networks and look for subnetworks made up of two distinct groups of nodes, connected by ‘one-way’ links. We show that a spectral approach can be used to find hidden substructures of this form. Theoretical support is given for the idealized case where there is limited overlap between subnetworks. Numerical experiments show that the approach is robust to spurious and missing edges. A key application of this work is in the analysis of high-throughput gene expression data, and we give an example where a biologically meaningful directed bipartite subnetwork is found from a cancer microarray dataset.

Information

Type
Research Article
Copyright
Copyright © London Mathematical Society 2011