It is shown that under a spectral gap condition, the top eigenvectors and eigenvalues of the graph's adjacency matrix can be used to approximately recover the point cloud up to an orthogonal transformation.
Abstract
We study the problem of recovering low-dimensional latent geometry from a random geometric graph generated by noisy, high-dimensional data. Specifically, we analyze the performance of a spectral embedding algorithm on the Signal+Noise Graph Model, in which vertices are associated to points perturbed by Gaussian noise, and edges are included for pairs whose inner product exceeds a specified alignment threshold. In the high-dimensional regime where the number $n$ of points and the ambient dimension $d$ both tend to infinity, we show that under a spectral gap condition, the top eigenvectors and eigenvalues of the graph's adjacency matrix can be used to approximately recover the point cloud up to an orthogonal transformation. We illustrate our results on point clouds sampled from nested spheres and high-dimensional sinusoid curves.
We introduce two new methods for boundary detection in high-dimensional point cloud data, intended to work in situations with non-uniform density, high ambient dimension, and substantial noise. Our first method fits a separating hyperplane on local neighborhoods after doing local dimension reduction---this method works...
Abigail Hickok, Valerio Galanti, Osama Al-Dalahmah et al.· 0 citations
HFS turns a classical heat field into a practical interface for multiscale geometric analysis in modern point-cloud learning, and introduces the Heat Dimension Spectrum (HDS), a compact summary of multiscale geometric composition.
Yuan-Qing Wang, Ya-Peng Tian, B. Coskunuzer· 0 citations
We introduce a statistical framework for Gaussian fields indexed at arbitrary edge locations on general compact directed metric graphs. The construction is based on a stochastic differential equation with a first-order operator and conditions at the vertices. We characterise well-posedness and identify the covariance r...
David Bolin, Alexandre de Bustamante Simas, E. Strandh et al.· 0 citations
The condensation method for recovering the circle of camera angles from the COIL image dataset is demonstrated, where a standard PCA pipeline produces spurious homology, and the quotient of views of a tetrahedron in the SYMSOL pose-estimation benchmark is demonstrated.
Recovering latent geometric structure from graph observations is a well-studied problem in statistical inference. Kapralov, Trevisan, and Wrzos-Kaminska (2026) introduced the problem of recovering the coordinate structure of the Boolean hypercube from a small random sample of its edges. More specifically, there are $n=...
Inferring network topology from noisy node observations is a central problem in graph signal processing. In this paper, we consider Laplacian-constrained graph estimation for Gaussian Markov random fields, focusing on the underdetermined regime in which the number of samples is smaller than the number of graph nodes. E...
Christoffer Kjellson, C. Altafini, Emma Tegling· IEEE Signal Processing Lette...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
