21 citations · 129 across the 21 of their papers we have counts for
4 papers · 1 filter
Sharp detection thresholds for random geometric graphs with polynomial average degrees
Hang Du, Cheng Mao, Nike Sun +2
We study the random geometric graph formed by connecting independent uniform points on whenever their inner product exceeds a threshold chosen to give edge de…
Recovery of latent inner products from an anisotropic Gaussian random geometric graph
Cheng Mao, Vidya Muthukumar
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_…
Geometric planted matchings in high dimensions: The power of multiple views
Timothy L. H. Wee, Kaylee Y. Yang, Zhou Fan +1
We study the problem of recovering the correspondence between a collection of points in and a noisy, permuted version of those points. In the high-dimensional re…
Resolution of the Detection Threshold Conjecture for Random Geometric Graphs in the Regime
Hang Du, Cheng Mao, Nike Sun +2
A random geometric graph (RGG) is generated by first sampling latent points independently and uniformly from the unit sphere in , and then connecting…