arXiv (All)
open access
Recovery of latent inner products from an anisotropic Gaussian random geometric graph
We study the problem of recovering latent inner products from a random geometric graph with anisotropic Gaussian latent points. More precisely, for an i.i.d. sample $x_1, \dots, x_n \sim N(0,Σ)$ where $Σ\in \mathbb{R}^{d \times d}$, an edge $(i,j)$ is present in the graph if and only if $\langle x_i
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The Gaussian Latent Machine: Efficient Prior and Posterior Sampling for Inverse Problems#144295
- Deriving Approximate Message Passing from the Convex Gaussian Min-Max Theorem#1342543
- Fast Graph Laplacian Estimation using Effective Resistance#1049405
- Free-Probabilistic State Evolution and Random Matrix Discrepancy#999518
- Quadratic form of heavy-tailed self-normalized random vector with applications in $α$-heavy Marčenko--Pastur law#793590
Record · ID 1341484
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive