On the choice of weight functions for linear representations of persistence diagrams

Vincent Divol; Wolfgang Polonik

doi:10.1007/s41468-019-00032-z

Divol, Vincent; Polonik, Wolfgang

2019-08-07 00:00:00

Persistence diagrams are efficient descriptors of the topology of a point cloud. As they do not naturally belong to a Hilbert space, standard statistical methods cannot be directly applied to them. Instead, feature maps (or representations) are commonly used for the analysis. A large class of feature maps, which we call linear, depends on some weight functions, the choice of which is a critical issue. An important criterion to choose a weight function is to ensure stability of the feature maps with respect to Wasserstein distances on diagrams. We improve known results on the stability of such maps, and extend it to general weight functions. We also address the choice of the weight function by considering an asymptotic setting; assume that $${\mathbb {X}}_n$$ X n is an i.i.d. sample from a density on $$[0,1]^d$$ [ 0 , 1 ] d . For the Čech and Rips filtrations, we characterize the weight functions for which the corresponding feature maps converge as n approaches infinity, and by doing so, we prove laws of large numbers for the total persistences of such diagrams. Those two approaches (stability and convergence) lead to the same simple heuristic for tuning weight functions: if the data lies near a d-dimensional manifold, then a sensible choice of weight function is the persistence to the power $$\alpha $$ α with $$\alpha \ge d$$ α ≥ d .

http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

Journal of Applied and Computational Topology Springer Journals

http://www.deepdyve.com/lp/springer-journals/on-the-choice-of-weight-functions-for-linear-representations-of-L0eoIdWSMN

On the choice of weight functions for linear representations of persistence diagrams

$Persistence diagrams are efficient descriptors of the topology of a point cloud. As they do not naturally belong to a Hilbert space, standard statistical methods cannot be directly applied to them. Instead, feature maps (or representations) are commonly used for the analysis. A large class of feature maps, which we call linear, depends on some weight functions, the choice of which is a critical issue. An important criterion to choose a weight function is to ensure stability of the feature maps with respect to Wasserstein distances on diagrams. We improve known results on the stability of such maps, and extend it to general weight functions. We also address the choice of the weight function by considering an asymptotic setting; assume that $${\mathbb {X}}_n$$ X n is an i.i.d. sample from a density on $$[0,1]^d$$ [ 0 , 1 ] d . For the Čech and Rips filtrations, we characterize the weight functions for which the corresponding feature maps converge as n approaches infinity, and by doing so, we prove laws of large numbers for the total persistences of such diagrams. Those two approaches (stability and convergence) lead to the same simple heuristic for tuning weight functions: if the data lies near a d-dimensional manifold, then a sensible choice of weight function is the persistence to the power $$\alpha $$ α with $$\alpha \ge d$$ α ≥ d .$

Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

On the choice of weight functions for linear representations of persistence diagrams

On the choice of weight functions for linear representations of persistence diagrams

Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

On the choice of weight functions for linear representations of persistence diagrams

On the choice of weight functions for linear representations of persistence diagrams

Abstract

Journal

Recommended Articles

References

Our policy towards the use of cookies