3 papers
cs.CG2024
Euclidean distance compression via deep random features
Brett Leroux, Luis Rademacher
Motivated by the problem of compressing point sets into as few bits as possible while maintaining information about approximate distances between points, we construct random nonlin…
math.PR2023
The minimum neighborliness of a random polytope
Brett Leroux
Let be a probability distribution on which assigns measure zero to every hyperplane and a set of points sampled independently from . What can be said abou…
math.CO2022
Expansion of random polytopes
Brett Leroux, Luis Rademacher
A conjecture of Mihail and Vazirani states that the edge expansion of the graph of every polytope is at least one. Any lower bound on the edge expansion gives an upper bound…