Grant: Alliance Grants
The University of Western Ontario
$25,000.00
Effective computations of homotopy-theoretic graph invariants
FY 2024-25
Summary
The long term objective of this project is to develop robust tools for computing homotopy-theoretic graph invariants and to apply them in data analysis, in particular, within systems medicine. Graphs are collections of nodes connected by edges and are used in a wide range of applications, e.g., for modelling social and technological networks. To quantify the complexity of a graph, one assigns to it (algebraic) objects that are simpler to understand (for instance, numbers) than the graph itself. A large class of such objects, called graph invariants, can be constructed using methods inspired by topology and homotopy theory.
The proposed collaboration will develop new families of graph invariants along with software allowing for effective computation thereof. The short-term objective, to be completed through this Catalyst grant, is to build software for computing discrete homotopy and discrete homology groups. These are two graph invariants known to be very discerning, but notoriously hard to compute. The collaborator on the proposal, Dr. Reinhard Laubenbacher (University of Florida, Department of Medicine) is a founder of the field of discrete homotopy theory. He also wrote the first software for computing discrete homology groups. This software will be used as a starting point for the current project. The applicant is an expert in discrete homotopy theory and has produced numerous theoretical advances that, when implemented, can greatly improve efficiency of the aforementioned computations. The resulting computational software will then be applied to analysis of Boolean gene regulatory network models.
This new synergistic collaboration will result in major advances in the mathematical fields of discrete homotopy theory and, more broadly, combinatorics. Their applications will range from areas of pure mathematics, for example, hyperplane arrangements and matroid theory, to data science. In particular, it will create new theoretical and computational tools for data and network analysis, with concrete applications to health care, finance, and tech.
Program
Alliance Grants
Recipient
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
597261-2024
Name nom
Kapulkin, Krzysztof KR
Department département
Mathematics
Organization id
36
Institution établissement
The University of Western Ontario
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2024
Competition year année de concours
2024
Award amount
25000
Program id
ALLRP
Program name en
Alliance Grants
Program name fr
Subventions Alliance
Group en
RESEARCH PARTNERSHIPS
Group fr
PARTENARIATS DE RECHERCHE
Committee code
96
Committee name en
RPP Internal Decision Cttee
Committee name fr
Cté de décision interne - PPR
Area of application code
801
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Computer software
Area of application fr
Logiciel
Research subject code
2910
Research subject group en
Pure mathematics
Research subject group fr
Mathématiques pures
Research subject en
Algebraic topology
Research subject fr
Topologie algébrique
Field of research list names en
Not available
Field of research list names fr
Non disponible
Socioeconomic objective list names en
Not available
Socioeconomic objective list names fr
Non disponible
Application title
Effective computations of homotopy-theoretic graph invariants
Keywords
discrete homotopy theory; graph; graph invariant; homology group; homotopy group; homotopy theory; topological data analysis
Application summary
The long term objective of this project is to develop robust tools for computing homotopy-theoretic graph invariants and to apply them in data analysis, in particular, within systems medicine. Graphs are collections of nodes connected by edges and are used in a wide range of applications, e.g., for modelling social and technological networks. To quantify the complexity of a graph, one assigns to it (algebraic) objects that are simpler to understand (for instance, numbers) than the graph itself. A large class of such objects, called graph invariants, can be constructed using methods inspired by topology and homotopy theory.
The proposed collaboration will develop new families of graph invariants along with software allowing for effective computation thereof. The short-term objective, to be completed through this Catalyst grant, is to build software for computing discrete homotopy and discrete homology groups. These are two graph invariants known to be very discerning, but notoriously hard to compute. The collaborator on the proposal, Dr. Reinhard Laubenbacher (University of Florida, Department of Medicine) is a founder of the field of discrete homotopy theory. He also wrote the first software for computing discrete homology groups. This software will be used as a starting point for the current project. The applicant is an expert in discrete homotopy theory and has produced numerous theoretical advances that, when implemented, can greatly improve efficiency of the aforementioned computations. The resulting computational software will then be applied to analysis of Boolean gene regulatory network models.
This new synergistic collaboration will result in major advances in the mathematical fields of discrete homotopy theory and, more broadly, combinatorics. Their applications will range from areas of pure mathematics, for example, hyperplane arrangements and matroid theory, to data science. In particular, it will create new theoretical and computational tools for data and network analysis, with concrete applications to health care, finance, and tech.