8 papers
Denoising Distances in Metric Measure Spaces
Han Huang, Pakawut Jiradilok, Elchanan Mossel
Recent work studied the problem of finding clusters and denoising pairwise distances from noisy distances of points sampled on a manifold. We study the same problems in more genera…
Reconstructing the Geometry of Random Geometric Graphs
Han Huang, Pakawut Jiradilok, Elchanan Mossel
Random geometric graphs are random graph models defined on metric spaces. Such a model is defined by first sampling points from a metric space and then connecting each pair of samp…
Denoising distances beyond the volumetric barrier
Han Huang, Pakawut Jiradilok, Elchanan Mossel
We study the problem of reconstructing the latent geometry of a -dimensional Riemannian manifold from a random geometric graph. While recent works have made significant progress…
Reconstructing Riemannian Metrics From Random Geometric Graphs
Han Huang, Pakawut Jiradilok, Elchanan Mossel
Random geometric graphs are random graph models defined on metric measure spaces. A random geometric graph is generated by first sampling points from a metric space and then connec…
Random Subwords and Billiard Walks in Affine Weyl Groups
Colin Defant, Pakawut Jiradilok, Elchanan Mossel
Let be an irreducible affine Weyl group, and let be a finite word over the alphabet of simple reflections of . Fix a probability . For each integer $…
Repeatable patterns and the maximum multiplicity of a generator in a reduced word
Christian Gaetz, Yibo Gao, Pakawut Jiradilok +2
We study the maximum multiplicity of a simple transposition in a reduced word for the longest permutation , a…