21 citations · 217 across the 52 of their papers we have counts for
6 papers · 1 filter
A Fast Algorithm for Computing Zigzag Representatives
Tamal K. Dey, Tao Hou, Dmitriy Morozov
Zigzag filtrations of simplicial complexes generalize the usual filtrations by allowing simplex deletions in addition to simplex insertions. The barcodes computed from zigzag filtr…
GEFL: Extended Filtration Learning for Graph Classification
Simon Zhang, Soham Mukherjee, Tamal K. Dey
Extended persistence is a technique from topological data analysis to obtain global multiscale topological information from a graph. This includes information about connected compo…
D-GRIL: End-to-End Topological Learning with 2-parameter Persistence
Soham Mukherjee, Shreyas N. Samaga, Cheng Xin +2
End-to-end topological learning using 1-parameter persistence is well-known. We show that the framework can be enhanced using 2-parameter persistence by adopting a recently introdu…
Efficient Algorithms for Complexes of Persistence Modules with Applications
Tamal K. Dey, Florian Russold, Shreyas N. Samaga
We extend the persistence algorithm, viewed as an algorithm computing the homology of a complex of free persistence or graded modules, to complexes of modules that are not free. We…
Computing Generalized Ranks of Persistence Modules via Unfolding to Zigzag Modules
Tamal K. Dey, Cheng Xin
For a -indexed persistence module , the (generalized) rank of is defined as the rank of the limit-to-colimit map for the diagram of vector spaces of …
Expressive Higher-Order Link Prediction through Hypergraph Symmetry Breaking
Simon Zhang, Cheng Xin, Tamal K. Dey
A hypergraph consists of a set of nodes along with a collection of subsets of the nodes called hyperedges. Higher-order link prediction is the task of predicting the existence of a…