Localization in 1D non-parametric latent space models from pairwise affinities
From MaRDI portal
Publication:6170608
DOI10.1214/23-ejs2134arXiv2108.03098MaRDI QIDQ6170608
Nicolas Verzelen, Christophe Giraud, Yann Issartel
Publication date: 10 August 2023
Published in: Electronic Journal of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.03098
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Network Cross-Validation for Determining the Number of Communities in Network Data
- Minimax rates of community detection in stochastic block models
- Angular synchronization by eigenvectors and semidefinite programming
- Performance ratio of polynomial heuristics for triangle inequality quadratic assignment problems
- Adaptive estimation of nonparametric geometric graphs
- On estimation and inference in latent structure random graphs
- Reconstruction of line-embeddings of graphons
- Spectral method and regularized MLE are both optimal for top-\(K\) ranking
- Incidence matrices and interval graphs
- Stochastically Transitive Models for Pairwise Comparisons: Statistical and Computational Issues
- Convex Relaxations for Permutation Problems
- Graph limits and exchangeable random graphs
- Random Plane Networks
- P-Complete Approximation Problems
- A Spectral Algorithm for Seriation and the Consecutive Ones Problem
- Random Geometric Graphs
- Latent Space Approaches to Social Network Analysis
- High-Dimensional Probability
- A spectral algorithm for envelope reduction of sparse matrices
- Perturbation Bounds for Procrustes, Classical Scaling, and Trilateration, with Applications to Manifold Learning
- Exact Minimax Estimation for Phase Synchronization
- Learning random points from geometric graphs or orderings
- A useful variant of the Davis–Kahan theorem for statisticians
- Achieving Optimal Misclassification Proportion in Stochastic Block Model
- Graph Laplacian Tomography From Unknown Random Projections
- Rank Centrality: Ranking from Pairwise Comparisons
- LATIN 2004: Theoretical Informatics
