Name
Abstract | ||
|---|---|---|
An algorithm is presented that constructs an acyclic partial matching on the cells of a given simplicial complex from a vector-valued function defined on the vertices and extended to each simplex by taking the least common upper bound of the values on its vertices. The resulting acyclic partial matching may be used to construct a reduced filtered complex with the same multidimensional persistent homology as the original simplicial complex filtered by the sublevel sets of the function. Numerical tests show that in practical cases the rate of reduction in the number of cells achieved by the algorithm is substantial. This promises to be useful for the computation of multidimensional persistent homology of simplicial complexes filtered by sublevel sets of vector-valued functions. |
Year | Venue | Field |
|---|---|---|
2015 | CoRR | Discrete mathematics,Combinatorics,Vertex (geometry),Upper and lower bounds,Simplicial homology,Persistent homology,Simplex,Simplicial complex,Blossom algorithm,Abstract simplicial complex,Mathematics |
DocType | Volume | Citations |
Journal | abs/1511.05427 | 0 |
PageRank | References | Authors |
0.34 | 7 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Madjid Allili | 1 | 46 | 8.64 |
| Tomasz Kaczynski | 2 | 41 | 5.36 |
| C. Landi | 3 | 192 | 9.50 |
| filippo masoni | 4 | 0 | 0.34 |