95 citations · 217 across the 25 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2023
A generalization of the persistent Laplacian to simplicial maps
Aziz Burak Gülen, Facundo Mémoli, Zhengchao Wan +1
The graph Laplacian is a fundamental object in the analysis of and optimization on graphs. This operator can be extended to a simplicial complex and therefore offers a way to p…
math.CO2019
A limit theorem for the st Betti number of layer- subgraphs in random graphs
Minghao Tian, Yusu Wang
We initiate the study of local topology of random graphs. The high level goal is to characterize local "motifs" in graphs. In this paper, we consider what we call the layer- sub…