Related papers: Bernstein type inequality for a class of dependent…
Bernstein's theorem (also called Hausdorff--Bernstein--Widder theorem) enables the integral representation of a completely monotonic function. We introduce a finite completely monotonic function, which is a completely monotonic function…
Consider a real diagonal deterministic matrix $X_n$ of size $n$ with spectral measure converging to a compactly supported probability measure. We perturb this matrix by adding a random finite rank matrix, with delocalized eigenvectors. We…
The following analog of Bernstein inequality for monotone rational functions is established: if $R$ is an increasing on $[-1,1]$ rational function of degree $n$, then $$ R'(x)<\frac{9^n}{1-x^2}\|R\|,\quad x\in (-1,1). $$ The exponential…
For the sequence of multi-indexes $\{\alpha_i\}_{i=1}^{m}$ and $\beta$ we study the inequality \[ \|D^{\beta} f\|_{L_1(\mathbb{T}^d)}\leq K_N \sum_{j= 1}^{m} \|D^{\alpha_j}f\|_{L_1(\mathbb{T}^d)}, \] where $f$ is a trigonometric polynomial…
Let $\BS_1,...,\BS_n$ be independent identically distributed random variables each having the standardized Bernoulli distribution with parameter $p\in(0,1)$. Let $m_*(p):=(1+p+2p^2)/(2\sqrt{p-p^2}+4p^2)$ if $0<p\le 1/2$ and $m_*(p):=1$ if…
This paper establishes new upper bounds for the sum of the $k$ largest eigenvalues of symmetric matrices. When applied to the adjacency matrix of a graph, our results improve upon a related bound due to Mohar {\bf [On the sum of k largest…
Concentration inequalities, a major tool in probability theory, quantify how much a random variable deviates from a certain quantity. This paper proposes a systematic convex optimization approach to studying and generating concentration…
This is a continuation of our papers \cite{AP2} and \cite{AP3}. In those papers we obtained estimates for finite differences $(\D_Kf)(A)=f(A+K)-f(A)$ of the order 1 and $(\D_K^mf)(A)\df\sum\limits_{j=0}^m(-1)^{m-j}(m\j)f\big(A+jK\big)$ of…
Bernstein problem for affine maximal type equation has been a core problem in affine geometry. A conjecture proposed firstly by Chern for entire graph and then extended by Trudinger-Wang to its fully generality asserts that any Euclidean…
We consider the spectrum of additive, polynomially vanishing random perturbations of deterministic matrices, as follows. Let $M_N$ be a deterministic $N\times N$ matrix, and let $G_N$ be a complex Ginibre matrix. We consider the matrix…
We establish Sobolev type inequalities in the noncommutative settings by generalizing monotone metrics in the space of quantum states, such as matrix-valued Beckner inequalities. We also discuss examples such as random transpositions and…
This paper studies the extreme gaps between eigenvalues of random matrices. We give the joint limiting law of the smallest gaps for Haar-distributed unitary matrices and matrices from the Gaussian unitary ensemble. In particular, the kth…
We prove deviation inequalities for sums of high-dimensional random matrices and operators with dependence and {\rc heavy tails}. Estimation of high-dimensional matrices is a concern for numerous modern applications. However, most results…
Improving upon results of Rudelson and Vershynin, we establish delocalization bounds for eigenvectors of independent-entry random matrices. In particular, we show that with high probability every eigenvector is delocalized, meaning any…
Novel concentration inequalities are obtained for the missing mass, i.e. the total probability mass of the outcomes not observed in the sample. We derive distribution-free deviation bounds with sublinear exponents in deviation size for…
We give a minimal list of inequalities characterizing the possible eigenvalues of a set of Hermitian matrices with positive semidefinite sum of bounded rank. This answers a question of A. Barvinok.
In this paper, we consider the addition of two matrices in generic position, namely A + U BU * , where U is drawn under the Haar measure on the unitary or the orthogonal group. We show that, under mild conditions on the empirical spectral…
In this paper, we establish novel concentration inequalities for additive functionals of geometrically ergodic Markov chains similar to Rosenthal inequalities for sums of independent random variables. We pay special attention to the…
Let $P(z)$ be a polynomial of degree $n,$ then it is known that for $\alpha\in\mathbb{C}$ with $|\alpha|\leq \frac{n}{2},$ \begin{align*} \underset{|z|=1}{\max}|\left|zP^{\prime}(z)-\alpha P(z)\right|\leq…
Conditional on the extended Riemann hypothesis, we show that with high probability, the characteristic polynomial of a random symmetric $\{\pm 1\}$-matrix is irreducible. This addresses a question raised by Eberhard in recent work. The main…