Home OALib Journal OALib PrePrints Submit Ranking News My Lib FAQ About Us Follow Us+
 Title Keywords Abstract Author All
Search Results: 1 - 10 of 100 matches for " "
 Page 1 /100 Display every page 5 10 20 Item
 Mathematics , 2008, Abstract: We derive concentration inequalities for the spectral measure of large random matrices, allowing for certain forms of dependence. Our main focus is on empirical covariance (Wishart) matrices, but general symmetric random matrices are also considered.
 Mathematics , 2008, Abstract: Let $S$ be the multiplicative semigroup of $q\times q$ matrices with positive entries such that every row and every column contains a strictly positive element. Denote by $(X_n)_{n\geq1}$ a sequence of independent identically distributed random variables in $S$ and by $X^{(n)} = X_n ... X_1$, $n\geq 1$, the associated left random walk on $S$. We assume that $(X_n)_{n\geq1}$ verifies the contraction property $\P(\bigcup_{n\geq1}[X^{(n)} \in S^\circ])>0$, where $S^\circ$ is the subset of all matrices which have strictly positive entries. We state conditions on the distribution of the random matrix $X_1$ which ensure that the logarithms of the entries, of the norm, and of the spectral radius of the products $X^{(n)}$, $n\ge 1$, are in the domain of attraction of a stable law.
 Mathematics , 2008, DOI: 10.1007/s00220-009-0822-4 Abstract: We study the asymptotic behavior of the appropriately scaled and possibly perturbed spectral measure $\mu$ of large random real symmetric matrices with heavy tailed entries. Specifically, consider the N by N symmetric matrix $Y_N^\sigma$ whose (i,j) entry is $\sigma(i/N,j/N)X_{ij}$ where \$(X_{ij}, 0
 Mathematics , 2014, Abstract: An exchangeable random matrix is a random matrix with distribution invariant under any permutation of the entries. For such random matrices, we show, as the dimension tends to infinity, that the empirical spectral distribution tends to the uniform law on the unit disc. This is an instance of the universality phenomenon known as the circular law, for a model of random matrices with dependent entries, rows, and columns. It is also a non-Hermitian counterpart of a result of Chatterjee on the semi-circular law for random Hermitian matrices with exchangeable entries. The proof relies in particular on a reduction to a simpler model given by a random shuffle of a rigid deterministic matrix, on Hermitization, and also on combinatorial concentration of measure and combinatorial Central Limit Theorem. A crucial step is a polynomial bound on the smallest singular value of exchangeable random matrices, which may be of independent interest.
 Mathematics , 2013, Abstract: This paper deals with symmetric random matrices whose upper diagonal entries are obtained from a linear random field with heavy tailed noise. It is shown that the maximum eigenvalue and the spectral radius of such a random matrix with dependent entries converge to the Frech\'et distribution after appropriate scaling. This extends a seminal result of Soshnikov(2004) when the tail index is strictly less than one.
 Mathematics , 2011, Abstract: We derive Concentration of Measure (CoM) inequalities for randomized Toeplitz matrices. These inequalities show that the norm of a high-dimensional signal mapped by a Toeplitz matrix to a low-dimensional space concentrates around its mean with a tail probability bound that decays exponentially in the dimension of the range space divided by a quantity which is a function of the signal. For the class of sparse signals, the introduced quantity is bounded by the sparsity level of the signal. However, we observe that this bound is highly pessimistic for most sparse signals and we show that if a random distribution is imposed on the non-zero entries of the signal, the typical value of the quantity is bounded by a term that scales logarithmically in the ambient dimension. As an application of the CoM inequalities, we consider Compressive Binary Detection (CBD).
 Yuriy Nemish Mathematics , 2015, Abstract: We consider products of independent square non-Hermitian random matrices. More precisely, let X(1),...,X(n) be random matrices with independent entries (real or complex with independent real and imaginary parts) with zero mean and variance 1/N. Soshnikov and O'Rourke showed that the empirical spectral distribution of the product X(1)X(2)..X(n) converges to the n-th power of the circular law. We prove that if the entries of the matrices X(1),...,X(n) satisfy uniform subexponential decay condition, then in the bulk the convergence of the ESD holds up to the optimal scale.
 Sean O'Rourke Mathematics , 2012, DOI: 10.1214/ECP.v17-2020 Abstract: We consider a class of real random matrices with dependent entries and show that the limiting empirical spectral distribution is given by the Marchenko-Pastur law. Additionally, we establish a rate of convergence of the expected empirical spectral distribution.
 Mathematics , 2004, DOI: 10.1214/009117904000000289 Abstract: Concentration of measure is studied, and obtained, for stable and related random vectors.
 Mathematics , 2013, Abstract: We study the asymptotic behavior of outliers in the spectrum of bounded rank perturbations of large random matrices. In particular, we consider perturbations of elliptic random matrices which generalize both Wigner random matrices and non-Hermitian random matrices with iid entries. As a consequence, we recover the results of Capitaine, Donati-Martin, and F\'eral for perturbed Wigner matrices as well as the results of Tao for perturbed random matrices with iid entries. Along the way, we prove a number of interesting results concerning elliptic random matrices whose entries have finite fourth moment; these results include a bound on the least singular value and the asymptotic behavior of the spectral radius.
 Page 1 /100 Display every page 5 10 20 Item