Graph spectral analysis of protein interaction network evolution

Thomas Thorne, Michael P. H. Stumpf

Research output: Contribution to journalArticlepeer-review

Abstract

We present an analysis of protein interaction network data via the comparison of models of network evolution to the observed data. We take a Bayesian approach and perform posterior density estimation using an approximate Bayesian computation with sequential Monte Carlo method. Our approach allows us to perform model selection over a selection of potential network growth models. The methodology we apply uses a distance defined in terms of graph spectra which captures the network data more naturally than previously used summary statistics such as the degree distribution. Furthermore, we include the effects of sampling into the analysis, to properly correct for the incompleteness of existing datasets, and have analysed the performance of our method under various degrees of sampling. We consider a number of models focusing not only on the biologically relevant class of duplication models, but also including models of scale-free network growth that have previously been claimed to describe such data. We find a preference for a duplication-divergence with linear preferential attachment model in the majority of the interaction datasets considered. We also illustrate how our method can be used to perform multi-model inference of network parameters to estimate properties of the full network from sampled data.
Original languageEnglish
Pages (from-to)2653-2666
Number of pages14
JournalJournal of the Royal Society, Interface
Volume9
Issue number75
DOIs
Publication statusPublished - 2012

Keywords

  • protein interaction networks
  • graph spectra
  • approximate Bayesian computation
  • network evolution
  • sequential Monte Carlo

Fingerprint

Dive into the research topics of 'Graph spectral analysis of protein interaction network evolution'. Together they form a unique fingerprint.

Cite this