English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

Persistence barcodes versus Kolmogorov signatures: Detecting modes of one-dimensional signals.

MPS-Authors
/persons/resource/persons32719

Munk,  A.
Research Group of Statistical Inverse-Problems in Biophysics, MPI for biophysical chemistry, Max Planck Society;

External Resource
No external resources are shared
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Bauer, U., Munk, A., Sieling, H., & Wardetzky, M. (2017). Persistence barcodes versus Kolmogorov signatures: Detecting modes of one-dimensional signals. Foundations of Computational Mathematics, 17(1), 1-33. doi:10.1007/s10208-015-9281-9.


Cite as: http://hdl.handle.net/11858/00-001M-0000-002C-DE41-7
Abstract
We investigate the problem of estimating the number of modes (i.e., local maxima)—a well-known question in statistical inference—and we show how to do so without presmoothing the data. To this end, we modify the ideas of persistence barcodes by first relating persistence values in dimension one to distances (with respect to the supremum norm) to the sets of functions with a given number of modes, and subsequently working with norms different from the supremum norm. As a particular case, we investigate the Kolmogorov norm. We argue that this modification has certain statistical advantages. We offer confidence bands for the attendant Kolmogorov signatures, thereby allowing for the selection of relevant signatures with a statistically controllable error. As a result of independent interest, we show that taut strings minimize the number of critical points for a very general class of functions. We illustrate our results by several numerical examples.