Recovering Riemannian metric distance from Random Geometric Graphs @SimonsInstitute
Recovering Riemannian metric distance from Random Geometric Graphs  @SimonsInstitute
Uploaded November 2026 | Updated November 2026, 4 days ago
Han Huang (MIT)
https://simons.berkeley.edu/talks/han-huang-mit-2026-11-03
Beyond Graph Laplacians
Recovering Riemannian metric distance from Random Geometric GraphsIn Search of Missing Mass: Disentangling Discoveries from HallucinationsExplicit lossless vertex expandersQuantum ergodicity on graphs (Part 2)Convex-body Sampling to the Kannan-Lovász-Simonovits ConjectureBuilding a Quantum Computer with QLDPC CodesSampling elements of a finite group: efficiency of the product replacement algorithm with...The power of subspace designs: Applications in coding theory, pseudorandomness, and beyondLightning TalksDiffusion in RL and robotics: how expressive policies changed how we use continuous actionsField dynamics and its applicationsOutlier singular values and (de)localized singular vectors of sparse random matrices
Simons Institute for the Theory of Computing |

Recovering Riemannian metric distance from Random Geometric Graphs

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER