2 citations · 5 across the 8 of their papers we have counts for
14 papers
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…
Hardness of approximation of centered convex bodies by polytopes
Han Huang, Mark Rudelson
The distance between convex bodies \(K, L \subseteq \R^n\) is defined as \[ d(K,L)= \inf \left\{ λ\ge 1: \ L-x \subseteq T (K-y) \subseteq λ(L-x) \right\}, \] where the infimum is…
Average-case analysis of the Gaussian Elimination with Partial Pivoting
Han Huang, Konstantin Tikhomirov
The Gaussian Elimination with Partial Pivoting (GEPP) is a classical algorithm for solving systems of linear equations. Although in specific cases the loss of precision in GEPP due…
Shotgun assembly of unlabeled Erdos-Renyi graphs
Han Huang, Konstantin Tikhomirov
Given a positive integer , an unlabeled graph on vertices, and a vertex of , let be the subgraph of induced by vertices of of distance at most on…
On Dimension-dependent concentration for convex Lipschitz functions in product spaces
Han Huang, Konstantin Tikhomirov
Let , , and let be a random vector in with independent --subgaussian components. We show that for every --Lipschitz conve…
Rank of Sparse Bernoulli Matrices
Han Huang
Let be an random matrix with i.i.d Bernoulli() entries. For a fixed positive integer , suppose satisfies whe…
Distribution of the minimal distance of random linear codes
Jing Hao, Han Huang, Galyna Livshyts +1
In this paper, we study the distribution of the minimal distance (in the Hamming metric) of a random linear code of dimension in . We provide quantitative estim…
A remark on the smallest singular value of powers of Gaussian matrices
Han Huang, Konstantin Tikhomirov
Let and let be the random matrix with i.i.d. standard real Gaussian entries. We show that there are constants depending only on such tha…
Improved bounds for Hadwiger's covering problem via thin-shell estimates
Han Huang, Boaz A. Slomka, Tomasz Tkocz +1
A central problem in discrete geometry, known as Hadwiger's covering problem, asks what the smallest natural number is such that every convex body in ${\mathbb R}…
Ulam Floating Body
Han Huang, Boaz A. Slomka, Elisabeth M. Werner
We study a new construction of bodies from a given convex body in which are isomorphic to (weighted) floating bodies. We establish several properties of this new c…
Approximations of convex bodies by measure-generated sets
Han Huang, Boaz A. Slomka
Given a Borel measure on , we define a convex set by \[ M(μ)=\bigcup_{\substack{0\le f\le1,\\ \int_{{\mathbb R}^{n}}f\,{\rm d}μ=1 } }\left\{ \int_{{\mathbb R}^…
John's Position is not good for approximation
Han Huang
Recall that a convex body is in John's position if the unit Euclidean ball is the maximal volume ellipsoid contained in . Approximating convex body in John's position by pol…
Upper bound for the Dvoretzky dimension in Milman-Schechtman theorem
Han Huang, Feng Wei
For a symmetric convex body , the Dvoretzky dimension is the largest dimension for which a random central section of is almost spherical. A Dvoretz…
John Ellipsoid and the Center of Mass of a Convex Body
Han Huang
It is natural to ask whether the center of mass of a convex body lies in its John ellipsoid , i.e., in the maximal volume ellipsoid contained in . T…