Back to search

Marshall University

Applications of Computational Homology

Abstract

dc:description.abstract

Homology is a field of topology that classifies objects based on the number of n- dimensional holes (cuts, tunnels, voids, etc.) they possess. The number of its real life ap- plications is quickly growing, which requires development of modern computational meth- ods. In my thesis, I will present methods of calculation, algorithms, and implementations of simplicial homology, alpha shapes, and persistent homology. The Alpha Shapes method represents a point cloud as the union of balls centered at each point, and based on these balls, a complex can be built and homology computed. If the balls are allowed to grow, one can compute the persistent homology, which gives a better understanding of the shape of the object represented by the point cloud by eliminating noise. These methods are particularly well suited for studying biological molecules. I will test the hypothesis that persistent homology can describe some important features of a protein's shape.

Degree

thesis:*
Name thesis:degree_name
Mathematics
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
College of Science

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Johnson, Christopher Aaron
Contributors dc:contributor
  • Peter Saveliev
  • Ralph Oberste-Vorth
  • Scott Sarra

Subjects

dc:subject × 7

Identifiers

dc:identifier.*
Repository record dc:identifier
https://mds.marshall.edu/etd/672

Chain of custody

source
Harvested from
Marshall University
Base URL
mds.marshall.edu/do/oai/
Last updated
2026-11-21
Source record
OAI-PMH GetRecord
citation

Johnson, Christopher Aaron. Applications of Computational Homology. Thesis thesis, https://mds.marshall.edu/etd/672