Centralities in simplicial complexes. Applications to protein interaction networks

Ernesto Estrada, Grant J. Ross

Research output: Contribution to journalArticle

18 Citations (Scopus)
12 Downloads (Pure)

Abstract

Complex networks can be used to represent complex systems which originate in the real world. Here we study a transformation of these complex networks into simplicial complexes, where cliques represent the simplices of the complex. We extend the concept of node centrality to that of simplicial centrality and study several mathematical properties of degree, closeness, betweenness, eigenvector, Katz, and subgraph centrality for simplicial complexes. We study the degree distributions of these centralities at the different levels. We also compare and describe the differences between the centralities at the different levels. Using these centralities we study a method for detecting essential proteins in PPI networks of cells and explain the varying abilities of the centrality measures at the different levels in identifying these essential proteins.
Original languageEnglish
Pages (from-to)46 - 60
Number of pages15
JournalJournal of Theoretical Biology
Volume438
Early online date8 Nov 2017
DOIs
Publication statusPublished - 7 Feb 2018

Keywords

  • protein interactions
  • simplicial complexes
  • complex networks
  • essential proteins
  • graph theory
  • network theory

Fingerprint Dive into the research topics of 'Centralities in simplicial complexes. Applications to protein interaction networks'. Together they form a unique fingerprint.

Cite this