1 citations · 1 across the 6 of their papers we have counts for
18 papers
Random Graph Matching with Improved Noise Robustness
Cheng Mao, Mark Rudelson, Konstantin Tikhomirov
Graph matching, also known as network alignment, refers to finding a bijection between the vertex sets of two given graphs so as to maximally align their edges. This fundamental co…
Singularity of sparse Bernoulli matrices
Alexander E. Litvak, Konstantin E. Tikhomirov
Let be an random matrix with i.i.d. Bernoulli(p) entries. We show that there is a universal constant such that, whenever and satisfy $C\log n/n\…
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…
The smallest singular value of inhomogeneous square random matrices
Galyna V. Livshyts, Konstantin Tikhomirov, Roman Vershynin
We show that for an random matrix with independent uniformly anti-concentrated entries, such that , the smallest singular value $…
Outliers in spectrum of sparse Wigner matrices
Konstantin Tikhomirov, Pierre Youssef
In this paper, we study the effect of sparsity on the appearance of outliers in the semi-circular law. Let be a sequence of random symmetric matrices such that…