A. Naor

activity

20032026

most citedA probabilistic approach to the geometry of the \ell_p^n-ball

181 citations · 501 across the 38 of their papers we have counts for

collaborators

Showing 2025Show all

4 papers · 1 filter

cs.DS2025

An optimal algorithm for average distance in typical regular graphs

Alexandros Eskenazis, Manor Mendel, Assaf Naor

We design a deterministic algorithm that, given $n$ points in a \emph{typical} constant degree regular~graph, queries $O (n)$ distances to output a constant factor approximation to…

math.MG2025

Approximate isoperimetry for convex polytopes

Keith Ball, Károly J. Böröczky, Assaf Naor

For all $n, ϕ \in N$ with $ϕ ⩾ n + 1$ , the smallest possible isoperimetric quotient of an $n$ -dimensional convex polytope that has $ϕ$ facets is shown to be bounded fro…

math.MG2025

The separation modulus of unitarily invariant matrix norms

Mustafa Alper Gunes, Assaf Naor

If $X = (M_{n} (R), ∥ \cdot ∥)$ is a unitarily invariant normed space on , then we prove (via exact computations for a Jacobi orthogonal random matrix ensemble) that the spectra…

math.FA2025

Euclidean embedding, randomized clustering, and Lipschitz extension for finite and doubling subsets of $L_{p}$ when $p > 2$

Assaf Naor, Kevin Ren

Fix $p > 2$ . We prove that the Euclidean distortion of every $n$ -point subset of $L_{p}$ is $p^{3} (lo g n)^{\frac{1}{2} + o (1)}$ , thus, in particular, demonstrating that all $n$ -point subsets…

An optimal algorithm for average distance in typical regular graphs

Approximate isoperimetry for convex polytopes

The separation modulus of unitarily invariant matrix norms

Euclidean embedding, randomized clustering, and Lipschitz extension for finite and doubling subsets of Lp​ when p>2

Euclidean embedding, randomized clustering, and Lipschitz extension for finite and doubling subsets of $L_{p}$ when $p > 2$