Centralities in simplicial complexes. Applications to protein interaction networks

Ernesto Estrada, Grant J. Ross

Research output: Contribution to journalArticle

5 Citations (Scopus)

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.
LanguageEnglish
Pages46 - 60
Number of pages15
JournalJournal of Theoretical Biology
Volume438
Early online date8 Nov 2017
DOIs
Publication statusPublished - 7 Feb 2018

Fingerprint

Protein Interaction Maps
Protein Interaction Networks
Centrality
Simplicial Complex
Complex networks
Proteins
Eigenvalues and eigenfunctions
Large scale systems
proteins
Complex Networks
Protein
cells
Betweenness
Degree Distribution
Clique
Eigenvector
methodology
Subgraph
Complex Systems
Cell

Keywords

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

Cite this

@article{fcbf2ba735854b0dad4ab365722c4c47,
title = "Centralities in simplicial complexes. Applications to protein interaction networks",
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.",
keywords = "protein interactions, simplicial complexes, complex networks, essential proteins, graph theory, network theory",
author = "Ernesto Estrada and Ross, {Grant J.}",
year = "2018",
month = "2",
day = "7",
doi = "10.1016/j.jtbi.2017.11.003",
language = "English",
volume = "438",
pages = "46 -- 60",
journal = "Journal of Theoretical Biology",
issn = "0022-5193",

}

Centralities in simplicial complexes. Applications to protein interaction networks. / Estrada, Ernesto; Ross, Grant J.

In: Journal of Theoretical Biology, Vol. 438, 07.02.2018, p. 46 - 60.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Centralities in simplicial complexes. Applications to protein interaction networks

AU - Estrada, Ernesto

AU - Ross, Grant J.

PY - 2018/2/7

Y1 - 2018/2/7

N2 - 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.

AB - 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.

KW - protein interactions

KW - simplicial complexes

KW - complex networks

KW - essential proteins

KW - graph theory

KW - network theory

U2 - 10.1016/j.jtbi.2017.11.003

DO - 10.1016/j.jtbi.2017.11.003

M3 - Article

VL - 438

SP - 46

EP - 60

JO - Journal of Theoretical Biology

T2 - Journal of Theoretical Biology

JF - Journal of Theoretical Biology

SN - 0022-5193

ER -