Central limit theorems for classical multidimensional scaling
DOI10.1214/20-EJS1720zbMATH Open1445.62117arXiv1804.00631MaRDI QIDQ2192306FDOQ2192306
Minh Tang, Gongkai Li, Nicolas Charon, Carey E. Priebe
Publication date: 17 August 2020
Published in: Electronic Journal of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.00631
Statistical aspects of information-theoretic topics (62B10) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Estimation in multivariate analysis (62H12) Central limit and other weak theorems (60F05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Diffusion maps
- Modern multidimensional scaling. Theory and applications.
- The Rotation of Eigenvectors by a Perturbation. III
- Automatic dimensionality selection from the scree plot via the use of profile likelihood
- Matrix estimation by universal singular value thresholding
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- High-Dimensional Probability
- Local Multidimensional Scaling for Nonlinear Dimension Reduction, Graph Drawing, and Proximity Analysis
- A useful variant of the Davis–Kahan theorem for statisticians
- Multidimensional scaling. I: Theory and method
- A class of invariant consistent tests for multivariate normality
- Measures of multivariate skewness and kurtosis with applications
- Multidimensional scaling.
- Energy statistics: a class of statistics based on distances
- User-friendly tail bounds for sums of random matrices
- The Dissimilarity Representation for Pattern Recognition
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- A limit theorem for scaled eigenvectors of random dot product graphs
- Large deformation diffeomorphic metric curve mapping
- The Euclidian Distance Matrix Completion Problem
- Solving Euclidean distance matrix completion problems via semidefinite progrmming
- A remark on global positioning from local distances
- Localization from incomplete noisy distance measurements
- Single subject incomplete designs for nonmetric multidimensional scaling
- Distance Shrinkage and Euclidean Embedding via Regularized Kernel Estimation
- Exact Reconstruction of Euclidean Distance Geometry Problem Using Low-Rank Matrix Completion
Cited In (2)
Uses Software
This page was built for publication: Central limit theorems for classical multidimensional scaling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2192306)