Showing 2026 · math.PRShow all
3 papers · 2 filters
math.PR2026
Online Permutation Embedding: Optimal Stopping and Scaling Laws
Dylan J. Altschuler, Quentin Dubroff, Konstantin Tikhomirov
We study optimal online algorithms for embedding a permutation of into an iid stream of uniform random variables. This problem is a broad generalization of the cl…
math.PR2026
Level-set entropy and sparse randomized embeddings
Konstantin Tikhomirov
Let be a sparse random matrix. For a fixed -dimensional subspace , let denote an isometry from ${\math…
math.PR2026
Well-invertible column subsets of sparse matrices are rare
Han Huang, Mark Rudelson, Konstantin Tikhomirov
A random matrix is an \emph{-oblivious subspace injection} (OSI) if for every , and for every fixed…