Topology, Geometry and Data Seminar - Samir Chowdhury

Image
Samir Chowdhury
November 13, 2018
4:10PM - 5:10PM
Location
Cockins Hall 240

Date Range
Add to Calendar 2018-11-13 16:10:00 2018-11-13 17:10:00 Topology, Geometry and Data Seminar - Samir Chowdhury Title: Persistent Path Homology of Directed Networks Speaker: Samir Chowdhury (Ohio State University) Abstract: While standard persistent homology has been successful in extracting information from metric datasets, its applicability to more general data, e.g. directed networks, is hindered by its natural insensitivity to asymmetry. We extend a construction of homology of digraphs due to Grigor’yan, Lin, Muranov and Yau to the persistent framework. The result, which we call persistent path homology (PPH), encodes a rich level of detail about the asymmetric structure of the input directed network. For example, we prove that PPH identifies a class of directed cyclic networks as directed analogues of the circle. In general, PPH produces signatures that differ from natural extensions of Vietoris-Rips or Čech persistence to the directed setting, but we prove that PPH agrees with Čech persistence on symmetric (undirected) networks. Additionally, we prove that PPH agrees with Čech persistence on directed networks satisfying a local condition that we call square-freeness. We prove stability of PPH by utilizing a separate theory of homotopy of digraphs that is compatible with path homology. Finally, we study computational aspects of PPH, and derive an algorithm showing that over field coefficients, computing PPH requires the same worst case running time as standard persistent homology. Seminar URL: https://tgda.osu.edu/ Cockins Hall 240 Department of Mathematics math@osu.edu America/New_York public
Description

Title: Persistent Path Homology of Directed Networks

SpeakerSamir Chowdhury (Ohio State University)

Abstract: While standard persistent homology has been successful in extracting information from metric datasets, its applicability to more general data, e.g. directed networks, is hindered by its natural insensitivity to asymmetry. We extend a construction of homology of digraphs due to Grigor’yan, Lin, Muranov and Yau to the persistent framework. The result, which we call persistent path homology (PPH), encodes a rich level of detail about the asymmetric structure of the input directed network. For example, we prove that PPH identifies a class of directed cyclic networks as directed analogues of the circle. In general, PPH produces signatures that differ from natural extensions of Vietoris-Rips or Čech persistence to the directed setting, but we prove that PPH agrees with Čech persistence on symmetric (undirected) networks. Additionally, we prove that PPH agrees with Čech persistence on directed networks satisfying a local condition that we call square-freeness. We prove stability of PPH by utilizing a separate theory of homotopy of digraphs that is compatible with path homology. Finally, we study computational aspects of PPH, and derive an algorithm showing that over field coefficients, computing PPH requires the same worst case running time as standard persistent homology.

Seminar URLhttps://tgda.osu.edu/

Events Filters: