3 citations · 4 across the 4 of their papers we have counts for
5 papers
Any Graph is a Mapper Graph
Enrique G Alvarado, Robin Belton, Kang-Ju Lee +4
The Mapper algorithm is a popular tool for visualization and data exploration in topological data analysis. We investigate an inverse problem for the Mapper algorithm: Given a data…
G-Mapper: Learning a Cover in the Mapper Construction
Enrique Alvarado, Robin Belton, Emily Fischer +4
The Mapper algorithm is a visualization technique in topological data analysis (TDA) that outputs a graph reflecting the structure of a given dataset. However, the Mapper algorithm…
Simplicial effective resistance and enumeration of spanning trees
Art M. Duval, Woong Kook, Kang-Ju Lee +1
A graph can be regarded as an electrical network in which each edge is a resistor. This point of view relates combinatorial quantities, such as the number of spanning trees, to ele…
Acyclic orientation polynomials and the sink theorem for chromatic symmetric functions
Byung-Hak Hwang, Woo-Seok Jung, Kang-Ju Lee +2
We define the acyclic orientation polynomial of a graph to be the generating function for the sinks of its acyclic orientations. Stanley proved that the number of acyclic orientati…
A weighted cellular matrix-tree theorem, with applications to complete colorful and cubical complexes
Ghodratollah Aalipour, Art M. Duval, Woong Kook +2
We present a version of the weighted cellular matrix-tree theorem that is suitable for calculating explicit generating functions for spanning trees of highly structured families of…