Strathprints logo
Strathprints Home | Open Access | Browse | Search | User area | Copyright | Help | Library Home | SUPrimo

Discovering bipartite substructure in directed networks

Taylor, A.J. and Vass, K. and Higham, Desmond (2011) Discovering bipartite substructure in directed networks. LMS Journal of Computation and Mathematics, 14. pp. 72-86.

[img]
Preview
PDF - Draft Version
Download (1424Kb) | Preview

    Abstract

    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 substructure of this form. Theoretical support is given for the idealised 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 data set.

    Item type: Article
    ID code: 29090
    Keywords: bipartite substructure, directed networks, subnetworks, discovering, Mathematics, Mathematics(all), Computational Theory and Mathematics
    Subjects: Science > Mathematics
    Department: Faculty of Science > Mathematics and Statistics
    Related URLs:
    Depositing user: Pure Administrator
    Date Deposited: 07 Mar 2011 23:25
    Last modified: 27 Mar 2014 11:09
    URI: http://strathprints.strath.ac.uk/id/eprint/29090

    Actions (login required)

    View Item

    Fulltext Downloads: