Statistical Analysis of Random Objects Via Metric Measure Laplacians
From MaRDI portal
Abstract: In this paper, we consider a certain convolutional Laplacian for metric measure spaces and investigate its potential for the statistical analysis of complex objects. The spectrum of that Laplacian serves as a signature of the space under consideration and the eigenvectors provide the principal directions of the shape, its harmonics. These concepts are used to assess the similarity of objects or understand their most important features in a principled way which is illustrated in various examples. Adopting a statistical point of view, we define a mean spectral measure and its empirical counterpart. The corresponding limiting process of interest is derived and statistical applications are discussed.
Cites work
- A course in metric geometry
- A lower bound for the second largest Laplacian eigenvalue of weighted graphs
- A statistical test of isomorphism between metric-measure spaces using the distance-to-a-measure signature
- Algorithms, graph theory, and linear equations in Laplacian matrices
- Asymptotic Statistics
- Bootstrapping general empirical measures
- Collective dynamics of `small-world' networks
- Computational optimal transport. With applications to data sciences
- Discrete Laplace operators
- Distribution of the Ratio of the Mean Square Successive Difference to the Variance
- DTM-based filtrations
- Fast convergence of empirical barycenters in Alexandrov spaces and the Wasserstein space
- Fast linear algebra is stable
- Gaussian elimination is not optimal
- Gromov-Wasserstein distances and the metric approach to object matching
- scientific article; zbMATH DE number 708500 (Why is no real title available?)
- scientific article; zbMATH DE number 2034517 (Why is no real title available?)
- scientific article; zbMATH DE number 3002670 (Why is no real title available?)
- scientific article; zbMATH DE number 6026126 (Why is no real title available?)
- Mathematical Foundations of Infinite-Dimensional Statistical Models
- Metric structures for Riemannian and non-Riemannian spaces. Transl. from the French by Sean Michael Bates. With appendices by M. Katz, P. Pansu, and S. Semmes. Edited by J. LaFontaine and P. Pansu
- New concentration inequalities in product spaces
- New Gromov-inspired metrics on phylogenetic tree space
- On a theorem of Godsil and McKay concerning the construction of cospectral graphs
- On the geometry of metric measure spaces. I
- Online Principal Component Analysis in High Dimension: Which Algorithm to Choose?
- Optimal Transport
- Quadratic programming with one negative eigenvalue is NP-hard
- Reconstruction of weighted graphs by their spectrum
- Sharper bounds for Gaussian and empirical processes
- Spectra of graphs
- Spectral stability of metric-measure Laplacians
- Unbalanced optimal transport: dynamic and Kantorovich formulations
- Weak convergence and empirical processes. With applications to statistics
- Which graphs are determined by their spectrum?
This page was built for publication: Statistical Analysis of Random Objects Via Metric Measure Laplacians
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6171689)