Projects per year
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 language | English |
---|---|
Pages (from-to) | 46 - 60 |
Number of pages | 15 |
Journal | Journal of Theoretical Biology |
Volume | 438 |
Early online date | 8 Nov 2017 |
DOIs | |
Publication status | Published - 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.Projects
- 1 Finished
-
Doctoral Training Partnership (DTP - University of Strathclyde) | Ross, Grant Jamieson
Langer, M. (Principal Investigator), Estrada, E. (Co-investigator) & Ross, G. J. (Research Co-investigator)
EPSRC (Engineering and Physical Sciences Research Council)
1/10/15 → 1/04/19
Project: Research Studentship - Internally Allocated
Datasets
-
Data for: "Centralities in Simplicial Complexes. Applications to Protein Interaction Networks"
Ross, G. J. (Creator) & Estrada, E. (Supervisor), University of Strathclyde, 9 Mar 2018
DOI: 10.15129/cf3c8924-85a9-4813-8896-48ba7dbe3fe4
Dataset