Related papers: Norms of Randomized Circulant Matrices

A recent development in random matrix theory, the intrinsic freeness principle, establishes that the spectrum of very general random matrices behaves as that of an associated free operator. This reduces the study of such random matrices to…

Let A be an n*n random matrix with mean zero and independent inhomogeneous non-constant subgaussian entries. We get that for any k<c\sqrt{n}, the probability of the matrix has a lower rank than n-k that is sub-exponential. Furthermore, we…

Lower and upper bounds are explored for the uniform (Kolmogorov) and $L^2$-distances between the distributions of weighted sums of dependent summands and the normal law. The results are illustrated for several classes of random variables…

The border rank of the matrix multiplication operator for n by n matrices is a standard measure of its complexity. Using techniques from algebraic geometry and representation theory, we show the border rank is at least 2n^2-n. Our bounds…

In this text we study the regularity of matrices with special polynomial entries. Barring some mild conditions we show that these matrices are regular if a natural limit size is not exceeded. The proof draws connections to generalized…

We present some extensions of Bernstein's concentration inequality for random matrices. This inequality has become a useful and powerful tool for many problems in statistics, signal processing and theoretical computer science. The main…

We prove a stability version of a general result that bounds the permanent of a matrix in terms of its operator norm. More specifically, suppose $A$ is an $n \times n$ matrix over $\mathbb{C}$ (resp. $\mathbb{R}$), and let $\mathcal{P}$…

In the present paper we propose generalizations of the regularity and counting lemmas for multidimensional matrices under a finite alphabet. Firstly, we prove a variant of a multidimensional regularity lemma with the help of a translation…

We give tight bounds for logarithmic mean. We also give new Frobenius norm inequalities for two positive semidefinite matrices. In addition, we give some matrix inequalities on matrix power mean.

We extend the random characteristics approach to Wigner matrices whose entries are not required to have a normal distribution. As an application, we give a simple and fully dynamical proof of the weak local semicircle law in the bulk.

The main goal of this article is to establish several new $\mathbb{A}$-numerical radius equalities and inequalities for $n\times n$ cross-diagonal, left circulant, skew left circulant operator matrices, where $\mathbb{A}$ is the $n\times n$…

A central question in random matrix theory is universality. When an emergent phenomena is observed from a large collection of chosen random variables it is natural to ask if this behavior is specific to the chosen random variable or if the…

This paper deals with the numerical approximation of normalizing constants produced by particle methods, in the general framework of Feynman-Kac sequences of measures. It is well-known that the corresponding estimates satisfy a central…

We investigate traces of powers of random matrices whose distributions are invariant under rotations (with respect to the Hilbert--Schmidt inner product) within a real-linear subspace of the space of $n\times n$ matrices. The matrices we…

We prove that the (non-symmetric) adjacency matrix of a uniform random $d$-regular directed graph on $n$ vertices is asymptotically almost surely invertible, assuming $\min(d,n-d)\ge C\log^2n$ for a sufficiently large constant $C>0$. The…

In various contexts in mathematical physics one needs to compute the logarithm of a positive unbounded operator. Examples include the von Neumann entropy of a density matrix and the flow of operators with the modular Hamiltonian in the…

Let $W_n= \frac{1}{\sqrt n} M_n$ be a Wigner matrix whose entries have vanishing third moment, normalized so that the spectrum is concentrated in the interval $[-2,2]$. We prove a concentration bound for $N_I = N_I(W_n)$, the number of…

We generalize Lindeberg's proof of the central limit theorem to an invariance principle for arbitrary smooth functions of independent and weakly dependent random variables. The result is applied to get a similar theorem for smooth functions…

The main goal of this article is to establish several new upper and lower bounds for the $\mathbb{A}$-numerical radius of $2\times 2$ operator matrices, where $\mathbb{A}$ be the $2\times 2$ diagonal operator matrix whose diagonal entries…

We present two theorems concerned with algorithmic randomness and differentiability of functions of several variables. Firstly, we prove an effective form of the Rademacher's Theorem: we show that computable randomness implies…