Thesis

Simplicial centrality measure applications : protein-protein interaction and wireless sensor networks

Downloadable Content

Download PDF
Creator
Rights statement
Awarding institution
  • University of Strathclyde
Date of award
  • 2025
Thesis identifier
  • T17447
Person Identifier (Local)
  • 201569184
Qualification Level
Qualification Name
Department, School or Faculty
Abstract
  • 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.
Advisor / supervisor
  • Langer, Matthias
Resource Type
DOI

Relations

Items

Thumbnail Title Date Uploaded Visibility Actions
file details PDF of thesis T17447 2025-08-27 Public Download