Centralities in simplicial complexes. Applications to protein interaction networks

JOURNAL OF THEORETICAL BIOLOGY

卷:438

Article

Estrada, Ernesto¹  Ross, Grant J.¹ 

[1] Univ Strathclyde, Dept Math & Stat, 26 Richmond St, Glasgow G11HX, Lanark, Scotland

关键词: Protein interactions;    Simplicial complexes;    Complex networks;    Essential proteins;    Centrality;    Graph theory;    Network theory;   

DOI  :  10.1016/j.jtbi.2017.11.003

来源: Elsevier

【 摘 要 】

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. (C) 2017 Elsevier Ltd. All rights reserved.

【 授权许可】

Free