Using networks to model discrete systems of interactions is very common in the literature. However, networks are limited to considering only paired interactions. One of the responses to this limitation is to extend the concept of an edge to contain more than two nodes. Simplicial complexes are one of the models of discrete interactions which features this extension and we shall study them here. Centrality measures are one of the main ways of studying networks and are used to discover which node is most important. We shall extend centrality measures to the case of simplicial complexes. We shall then use these centrality measures on simplicial complexes to analyse protein–protein interaction networks and detect nodes whose removal would cause a gap in coverage on wireless sensor networks. We also assess the ways that dynamic systems work on random geometric graphs which have central sections missing.
| Date of Award | 19 Aug 2025 |
|---|
| Original language | English |
|---|
| Awarding Institution | - University Of Strathclyde
|
|---|
| Sponsors | EPSRC (Engineering and Physical Sciences Research Council) |
|---|
| Supervisor | Matthias Langer (Supervisor) & Ernesto Estrada (Supervisor) |
|---|