Centralities in simplicial complexes. Applications to protein interaction networks
Estrada, Ernesto and Ross, Grant J. (2018) Centralities in simplicial complexes. Applications to protein interaction networks. Journal of Theoretical Biology, 438. 46 - 60. ISSN 0022-5193 (https://doi.org/10.1016/j.jtbi.2017.11.003)
Preview |
Text.
Filename: Estrada_Ross_JTB_2018_Centralities_in_simplicial_complexes_applications_to_protein.pdf
Accepted Author Manuscript License: Download (1MB)| Preview |
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.
ORCID iDs
Estrada, Ernesto ORCID: https://orcid.org/0000-0002-3066-7418 and Ross, Grant J. ORCID: https://orcid.org/0000-0002-8610-6468;-
-
Item type: Article ID code: 65817 Dates: DateEvent7 February 2018Published8 November 2017Published Online7 November 2017AcceptedSubjects: Science > Mathematics Department: Faculty of Science > Mathematics and Statistics Depositing user: Pure Administrator Date deposited: 16 Oct 2018 14:17 Last modified: 30 Sep 2024 22:01 Related URLs: URI: https://strathprints.strath.ac.uk/id/eprint/65817