Metraipolis › archive › dc_097bb264b3be
Covariance and Principal Component Analysis on Riemannian Manifolds and Graphs — arXiv:2609.15753
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.15753
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T01:11:56.631Z
- SHA-256 of the archived text
a0589539674a259eef08f8aff118fab045cb10cff9fee2eb8983229614094294- Stable URL of this page
https://metraipolis.com/documento/dc_097bb264b3be
How to cite
Covariance and Principal Component Analysis on Riemannian Manifolds and Graphs — arXiv:2609.15753 — arXiv (en), https://arxiv.org/abs/2609.15753 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_097bb264b3be (Metraipolis archive dc_097bb264b3be, sha256 a0589539674a259eef08f8aff118fab045cb10cff9fee2eb8983229614094294)
BibTeX
@misc{dc097bb264b3be,
title = {Covariance and Principal Component Analysis on Riemannian Manifolds and Graphs — arXiv:2609.15753},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.15753},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_097bb264b3be; sha256 a0589539674a259eef08f8aff118fab045cb10cff9fee2eb8983229614094294},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.15753. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We develop notions of covariance and principal component analysis (PCA) for probability measures on Riemannian manifolds of bounded geometry and a discrete counterpart for distributions on the vertex sets of weighted simple graphs. Rather than anchoring variation at the Fréchet mean, whose uniqueness and usefulness can fail in this context, we consider variation about every point. This leads to a representation of each point on the manifold by a vector field derived from the heat kernel and thus to a map of the underlying manifold into a Hilbert space of vector fields, in which covariance and PCA carry over from the Euclidean setting. A distinguishing feature of this formulation is that one typically obtains infinitely many principal components, capable of capturing highly nonlinear geometric features and patterns of variation. We prove an embedding theorem for the mapping into the space of vector fields and develop two computational reductions of the theory: RiePCA, a finite-dimensional reduction based on vector fields supported on finitely many points, and GraphPCA, a discrete formulation for measures on weighted graphs in which vector fields assign orientations and magnitudes to edges. Numerical examples and experiments illustrate the behavior of the proposed methods on both synthetic and real data. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-15 in math.ST). Categorie arXiv: Statistics Theory (math.ST). Pagina del lavoro: https://arxiv.org/abs/2609.15753 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-16T00:31:08.668Z dalla pagina https://arxiv.org/catchup/math.ST/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).