Decompounding on Compact Symmetric Spaces

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteur principal: Kennerland, Erik
Format: Preprint
Publié: 2026
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866911601713479680
author Kennerland, Erik
author_facet Kennerland, Erik
contents This paper examines a stochastic deconvolution problem on compact symmetric spaces which is referred to as decompounding. This involves estimating the step distributions of a random walk, where in addition the number of steps between observations is unknown. The harmonic analysis of symmetric spaces is used to construct an estimator to the problem which converges in mean squared error, extending and improving on the analogous problem on compact Lie groups. The rates of convergence are shown to coincide with asymptotic lower bounds of density estimation in Euclidean space. We provide proofs that while the same rates hold for general density estimation problems in compact symmetric spaces, the decompounding problem lies in a subclass of these with different lower bounds depending on the rank of the space. Consequently, the optimality of the estimator depends on the rank of the symmetric space. Decompounding is a broad problem which appears in applications ranging from mathematical finance to wave optics, and the extension to compact symmetric spaces covers manifolds that commonly appear in the statistics literature.
format Preprint
id arxiv_https___arxiv_org_abs_2604_15980
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Decompounding on Compact Symmetric Spaces
Kennerland, Erik
Statistics Theory
This paper examines a stochastic deconvolution problem on compact symmetric spaces which is referred to as decompounding. This involves estimating the step distributions of a random walk, where in addition the number of steps between observations is unknown. The harmonic analysis of symmetric spaces is used to construct an estimator to the problem which converges in mean squared error, extending and improving on the analogous problem on compact Lie groups. The rates of convergence are shown to coincide with asymptotic lower bounds of density estimation in Euclidean space. We provide proofs that while the same rates hold for general density estimation problems in compact symmetric spaces, the decompounding problem lies in a subclass of these with different lower bounds depending on the rank of the space. Consequently, the optimality of the estimator depends on the rank of the symmetric space. Decompounding is a broad problem which appears in applications ranging from mathematical finance to wave optics, and the extension to compact symmetric spaces covers manifolds that commonly appear in the statistics literature.
title Decompounding on Compact Symmetric Spaces
topic Statistics Theory
url https://arxiv.org/abs/2604.15980