We prove estimates for the expected value of operator norms of Gaussian random matrices with independent and mean-zero entries, acting as operators from $\ell^m_{p^*}$ to $\ell_q^n$, $1\leq p^* \leq 2 \leq q \leq \infty$.
Let $C$ be a real-valued $M\times M$ matrix with singular values $λ_1\ge...\geλ_M$ and $E$ a random matrix of centered i.i.d. entries with finite fourth moment. In this paper we give a universal upper bound on the expectation of $||\hatπ_rX||_{S_2}^2-||π_rX||^2_{S_2}$, where $X:=C+E$ and $\hatπ_r$ (resp. $π_r$) is a rank-$r$ projection maximizing the Hilbert-Schmidt norm $||\tildeπ_rX||_{S_2}$ (resp. $||\tildeπ_rC||_{S_2}$) over the set $§_{M,r}$ of all orthogonal rank-$r$ projections. This result is a generalization of a theorem for Gaussian matrices due to Rohde (2012). Our approach differs …
In this paper, we consider continuous-time Markov chains with a finite state space under nonlinear expectations. We define so-called Q-operators as an extension of Q-matrices or rate matrices to a nonlinear setup, where the nonlinearity is due to model uncertainty. The main result gives a full characterization of convex Q-operators in terms of a positive maximum principle, a dual representation by means of Q-matrices, continuous-time Markov chains under convex expectations and nonlinear ordinary differential equations. This extends a classical characterization of generators of Markov chains to…
We show that the maximum moments of the sum of independent positive semidefinite random matrices with given norm upper bounds and norms of expectations is attained when all the random matrices are the multiplications of certain random variables and the identity matrix.
The sub-linear expectation or called G-expectation is a nonlinear expectation having advantage of modeling non-additive probability problems and the volatility uncertainty in finance. Let $\{X_n;n\ge 1\}$ be a sequence of independent random variables in a sub-linear expectation space $(Ω, \mathscr{H}, \widehat{\mathbb E})$. Denote $S_n=\sum_{k=1}^n X_k$ and $V_n^2=\sum_{k=1}^n X_k^2$. In this paper, a moderate deviation for self-normalized sums, that is, the asymptotic capacity of the event $\{S_n/V_n \ge x_n \}$ for $x_n=o(\sqrt{n})$, is found both for identically distributed random variables…
We present a simple, yet useful result about the expected value of the determinant of random sum of rank-one matrices. Computing such expectations in general may involve a sum over exponentially many terms. Nevertheless, we show that an interesting and useful class of such expectations that arise in, e.g., D-optimal estimation and random graphs can be computed efficiently via computing a single determinant.
We present some results concerning the almost sure behaviour of the operator norm or random Toeplitz matrices, including the law of large numbers for the norm, normalized by its expectation (in the i.i.d. case). As tools we present some concentration inequalities for suprema of empirical processes, which are refinements of recent results by Einmahl and Li.
In this short note we address a gaussian property of normal vectors in random non-Hermitian matrices. The approach uses a simple geometric and comparison technique.
We discuss regularization by noise of the spectrum of large random non-Normal matrices. Under suitable conditions, we show that the regularization of a sequence of matrices that converges in *-moments to a regular element $a$, by the addition of a polynomially vanishing Gaussian Ginibre matrix, forces the empirical measure of eigenvalues to converge to the Brown measure of $a$.
Let $\{X_n;n\ge 1\}$ be a sequence of independent and identically distributed random variables on a sub-linear expectation space $(Ω,\mathscr{H},\widehat{\mathbb E})$, $S_n=X_1+\ldots+X_n$. We consider the moments of $\max_{n\ge 1}|S_n|/\sqrt{2n\log\log n}$. The sufficient and necessary conditions for the moments to be finite are given. As an application, we obtain the law of the iterated logarithm for moving average processes of independent and identically distributed random variables.
We investigate the spectral norms of symmetric $N \times N$ matrices from two pseudo-random ensembles. The first is the pseudo-Wigner ensemble introduced in "Pseudo-Wigner Matrices" by Soloveychik, Xiang and Tarokh and the second is its sample covariance-type analog defined in this work. Both ensembles are defined through the concept of $r$-independence by controlling the amount of randomness in the underlying matrices, and can be constructed from dual BCH codes. We show that when the measure of randomness $r$ grows as $N^ρ$, where $ρ\in (0,1]$ and $\varepsilon > 0$, the norm of the matrices i…
We present a simple and versatile method for deriving (an)isotropic local laws for general random matrices constructed from independent random variables. Our method is applicable to mean-field random matrices, where all independent variables have comparable variances. It is entirely insensitive to the expectation of the matrix. In this paper we focus on the probabilistic part of the proof -- the derivation of the self-consistent equations. As a concrete application, we settle in complete generality the local law for Wigner matrices with arbitrary expectation.
We compute the limiting eigenvalue statistics at the edge of the spectrum of large Hermitian random matrices perturbed by the addition of small rank deterministic matrices. To be more precise, we consider random Hermitian matrices with independent Gaussian entries $M_{ij}, i\leq j$ with various expectations. We prove that the largest eigenvalue of such random matrices exhibits, in the large $N$ limit, various limiting distributions depending on both the eigenvalues of the matrix $(\mathbb{E}M_{ij})_{i,j=1}^N$ and its rank.
This paper investigates an upper bound of the operator norm for sub-Gaussian tailed random matrices. A lot of attention has been put on uniformly bounded sub-Gaussian tailed random matrices with independent coefficients. However, little has been done for sub-Gaussian tailed random matrices whose matrix coefficients variance are not equal or for matrix for which coefficients are not independent. This is precisely the subject of this paper. After proving that random matrices with uniform sub-Gaussian tailed independent coefficients satisfy the Tracy Widom bound, that is, their matrix operator no…
We give a non-asymptotic bound on the spectral norm of a $d\times d$ matrix $X$ with centered jointly Gaussian entries in terms of the covariance matrix of the entries. In some cases, this estimate is sharp and removes the $\sqrt{\log d}$ factor in the noncommutative Khintchine inequality.
Imprecise Transition Matrices for Markov Cohort Models: Lower and Upper Expectations with a Practical Health Economic Application
Medtronic Trading Sàrl(美敦力贸易公司);Center for Evidence Synthesis in Health, Department of Health Services, Policy, and Practice, Brown University(布朗大学健康服务、政策与实践系健康证据综合中心)
In this work, we consider symmetric random Toeplitz matrices $T_n$ generated by i.i.d. zero mean random variables ${X_k}$ satisfying the moment conditions: $E|X_k|^2=1$ and $\E|X_1|^n \le n^{\sqrt{n}}$ for all $n\ge 3$. We prove that the largest eigenvalue of $T_n$ scaled by $\sqrt{n log(n)}$ converges almost surely to $1$.
Can the behavior of a random matrix be improved by modifying a small fraction of its entries? Consider a random matrix $A$ with i.i.d. entries. We show that the operator norm of $A$ can be reduced to the optimal order $O(\sqrt{n})$ by zeroing out a small submatrix of $A$ if and only if the entries have zero mean and finite variance. Moreover, we obtain an almost optimal dependence between the size of the removed submatrix and the resulting operator norm. Our approach utilizes the cut norm and Grothendieck-Pietsch factorization for matrices, and it combines the methods developed recently by C. …
Suppose that $X_1,\...,X_n,\...$ are i.i.d. rotationally invariant $N$-by-$N$ matrices. Let $Π_n=X_n\... X_1$. It is known that $n^{-1}\log |Π_n|$ converges to a nonrandom limit. We prove that under certain additional assumptions on matrices $X_i$ the speed of convergence to this limit does not decrease when the size of matrices, $N$, grows.
In contemporary applied and computational mathematics, a frequent challenge is to bound the expectation of the spectral norm of a sum of independent random matrices. This quantity is controlled by the norm of the expected square of the random matrix and the expectation of the maximum squared norm achieved by one of the summands; there is also a weak dependence on the dimension of the random matrix. The purpose of this paper is to give a complete, elementary proof of this important, but underappreciated, inequality.
The asymptotic freeness of independent unitarily invariant $N\times N$ random matrices holds in expectation up to $O(N^{-2})$. An already known consequence is the infinitesimal freeness in expectation. We put in evidence another consequence for unitarily invariant random matrices: the almost sure asymptotic freeness of type $B$. As byproducts, we recover the asymptotic cyclic monotonicity, and we get the asymptotic conditional freeness. In particular, the eigenvector empirical spectral distribution of the sum of two randomly rotated random matrices converges towards the conditionally free conv…
We prove Anderson localization (AL) and dynamical localization in expectation (EDL, also known as strong dynamical localization) for random CMV matrices for arbitrary distribution of i.i.d. Verblunsky coefficients.
Let X_N= (X_1^(N), ..., X_p^(N)) be a family of N-by-N independent, normalized random matrices from the Gaussian Unitary Ensemble. We state sufficient conditions on matrices Y_N =(Y_1^(N), ..., Y_q^(N)), possibly random but independent of X_N, for which the operator norm of P(X_N, Y_N, Y_N^*) converges almost surely for all polynomials P. Limits are described by operator norms of objects from free probability theory. Taking advantage of the choice of the matrices Y_N and of the polynomials P we get for a large class of matrices the "no eigenvalues outside a neighborhood of the limiting spectru…
The relation between random normal matrices and conformal mappings discovered by Wiegmann and Zabrodin is made rigorous by restricting normal matrices to have spectrum in a bounded set. It is shown that for a suitable class of potentials the asymptotic density of eigenvalues is uniform with support in the interior domain of a simple smooth curve.
We introduce a formulation of quantum theory (QT) as a general probabilistic theory but expressed via quasi-expectation operators (QEOs). This formulation provides a direct interpretation of density matrices as quasi-moment matrices. Using QEOs, we will provide a series of representation theorems, a' la de Finetti, relating a classical probability mass function (satisfying certain symmetries) to a quasi-expectation operator. We will show that QT for both distinguishable and indistinguishable particles can be formulated in this way. Although particles indistinguishability is considered a truly …
In this paper, we investigate the following question: How often is a random matrix normal? We consider a random $n\times n$ matrix, $M_n$, whose entries are i.i.d. Rademacher random variables (taking values $\{ \pm1 \}$ with probability $1/2$) and prove $$2^{-\left(0.5+o(1)\right)n^2} \le P\left(M_n \text{ is normal}\right) \le 2^{-(0.302+o(1))n^{2}}. $$ We conjecture that the lower bound is sharp.
We introduce the notion of a random matrix-valued multiplicative function, generalizing Rademacher random multiplicative functions to matrices. We provide an asymptotic for the second moment based on a linear recurrence property for Hilbert-Schmidt norms of sucessive products of random matrices. Moreover, we provide upper bounds for the higher even moments related to the generalized joint spectral radius.
We extend the relation between random matrices and free probability theory from the level of expectations to the level of fluctuations. We introduce the concept of "second order freeness" and derive the global fluctuations of Gaussian and Wishart random matrices by a general limit theorem for second order freeness. By introducing cyclic Fock space, we also give an operator algebraic model for the fluctuations of our random matrices in terms of the usual creation, annihilation, and preservation operators. We show that orthogonal families of Gaussian and Wishart random matrices are asymptoticall…
We study the spectral norm of matrices M that can be factored as M=BA, where A is a random matrix with independent mean zero entries, and B is a fixed matrix. Under the (4+epsilon)-th moment assumption on the entries of A, we show that the spectral norm of such an m by n matrix M is bounded by \sqrt{m} + \sqrt{n}, which is sharp. In other words, in regard to the spectral norm, products of random and deterministic matrices behave similarly to random matrices with independent entries. This result along with the previous work of M. Rudelson and the author implies that the smallest singular value …
We prove concentration results for $\ell_p^n$ operator norms of rectangular random matrices and eigenvalues of self-adjoint random matrices. The random matrices we consider have bounded entries which are independent, up to a possible self-adjointness constraint. Our results are based on an isoperimetric inequality for product spaces due to Talagrand.
We study the spectral norm of N-dimensional hermitian random matrices whose entries are zero outside of the band of the width b along the principal diagonal. Inside this band the elements are given by gaussian centered jointly independent random variables with the variance of the order 1/b. We show that if b tends to infinity faster than the third power of log N, then the spectral norm is bounded with probability 1.
We introduce a family of norms on the $n \times n$ complex matrices. These norms arise from a probabilistic framework, and their construction and validation involve probability theory, partition combinatorics, and trace polynomials in noncommuting variables. As a consequence, we obtain a generalization of Hunter's positivity theorem for the complete homogeneous symmetric polynomials.
We study random normal matrix models whose eigenvalues tend to be distributed within a narrow "band" around the unit circle of width proportional to $\frac1n$, where $n$ is the size of matrices. For general radially symmetric potentials with various boundary conditions, we derive the scaling limits of the correlation functions, some of which appear in the previous literature notably in the context of almost-Hermitian random matrices. We also obtain that fluctuations of the maximal and minimal modulus of the ensembles follow the Gumbel or exponential law depending on the boundary conditions.
We consider large random matrices with a general slowly decaying correlation among its entries. We prove universality of the local eigenvalue statistics and optimal local laws for the resolvent away from the spectral edges, generalizing the recent result of [arXiv:1604.08188] to allow slow correlation decay and arbitrary expectation. The main novel tool is a systematic diagrammatic control of a multivariate cumulant expansion.
Let $X_N$ be an $N\ts N$ random symmetric matrix with independent equidistributed entries. If the law $P$ of the entries has a finite second moment, it was shown by Wigner \cite{wigner} that the empirical distribution of the eigenvalues of $X_N$, once renormalized by $\sqrt{N}$, converges almost surely and in expectation to the so-called semicircular distribution as $N$ goes to infinity. In this paper we study the same question when $P$ is in the domain of attraction of an $α$-stable law. We prove that if we renormalize the eigenvalues by a constant $a_N$ of order $N^{\frac{1}α}$, the correspo…
We establish a connection between the $L^2$ norm of sums of dilated functions whose $j$th Fourier coefficients are $\mathcal{O}(j^{-α})$ for some $α\in (1/2,1)$, and the spectral norms of certain greatest common divisor (GCD) matrices. Utilizing recent bounds for these spectral norms, we obtain sharp conditions for the convergence in $L^2$ and for the almost everywhere convergence of series of dilated functions.
In this paper we prove the concavity of the $k$-trace functions, $A\mapsto (\text{Tr}_k[\exp(H+\ln A)])^{1/k}$, on the convex cone of all positive definite matrices. $\text{Tr}_k[A]$ denotes the $k_{\mathrm{th}}$ elementary symmetric polynomial of the eigenvalues of $A$. As an application, we use the concavity of these $k$-trace functions to derive tail bounds and expectation estimates on the sum of the $k$ largest (or smallest) eigenvalues of a sum of random matrices.