5 citations · 10 across the 7 of their papers we have counts for
4 papers · 1 filter
Fast and Scalable Complex Network Descriptor Using PageRank and Persistent Homology
Mustafa Hajij, Elizabeth Munch, Paul Rosen
The PageRank of a graph is a scalar function defined on the node set of the graph which encodes nodes centrality information of the graph. In this article, we use the PageRank func…
Propagate and Pair: A Single-Pass Approach to Critical Point Pairing in Reeb Graphs
Junyi Tu, Mustafa Hajij, Paul Rosen
With the popularization of Topological Data Analysis, the Reeb graph has found new applications as a summarization technique in the analysis and visualization of large and complex…
An Efficient Data Retrieval Parallel Reeb Graph Algorithm
Mustafa Hajij, Paul Rosen
The Reeb graph of a scalar function defined on a domain gives a topologically meaningful summary of that domain. Reeb graphs have been shown in the past decade to be of great impor…
Homology-Preserving Dimensionality Reduction via Manifold Landmarking and Tearing
Lin Yan, Yaodong Zhao, Paul Rosen +2
Dimensionality reduction is an integral part of data visualization. It is a process that obtains a structure preserving low-dimensional representation of the high-dimensional data.…