Computational tools in weighted persistent homology (Q2044108)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Computational tools in weighted persistent homology |
scientific article |
Statements
Computational tools in weighted persistent homology (English)
0 references
4 August 2021
0 references
Let \(K\) be a simplicial complex and \(R\) an integral domain. A weight function for \(K\) is a map \(w:K\rightarrow R\) such that \(w(\sigma_1)\) divides \(w(\sigma_2)\) whenever \(\sigma_1\subseteq\sigma_2\). By taking the boundary map of an \(n\)-simplex to be the weighted sum \(\partial_n(\sigma)=\sum_{i=0}^n(-1)^i(w(\sigma)/w(d_i\sigma))d_i\sigma\), where \(d_i\) is the usual face map, one obtains the weighted simplicial homology group \(H_n(K,w)\). The authors show that weighted homology is isomorphic to unweighted homology if and only if \(R\) is a field. And for an integer-valued weight function, there is a Bockstein spectral sequence for weighted homology. This construction is generalized to weight functions with values in a principal ideal domain. For a filtration of weighted simplicial complexes, weighted persistent homology can be defined in a natural way, and the weighting gives rise to various filtrations. Indeed for any ideal \(I\) in \(R\), \(K\setminus w^{-1}(I)\) is a subcomplex. So that a descending chain of ideals defines a filtration on \(K\). This has applications to weighted graphs. Another filtration is obtained if there is a weight function \(w:K\rightarrow k[V]\), where \(V\) is the vertex set of \(K\) and \(k\) is a field. Form the filtration \(K\doteq K_1\supseteq K_2\supseteq\cdots\) by setting \(K_{i+1}\doteq K_i\setminus w^{-1}(I_{K_i})\), where \(I_{K_i}\) is the Stanley-Reisner ideal of \(K_i\).
0 references
weighted simplicial complex
0 references
weighted persistent homology
0 references
Bockstein spectral sequence
0 references
0 references
0 references