Related papers: Universality for the conjugate gradient and MINRES…
The spectral density of random matrices is studied through a quaternionic generalisation of the Green's function, which precisely describes the mean spectral density of a given matrix under a particular type of random perturbation. Exact…
Motivated by the Central Limit Theorem, in this paper, we study both universal and non-universal simulations of random variables with an arbitrary target distribution $Q_{Y}$ by general mappings, not limited to linear ones (as in the…
We prove that, for general test functions, the limiting behavior of the linear statistic of an independent entry random matrix is determined only by the first four moments of the entry distributions. This immediately generalizes the known…
In this work, we prove limitations on the known methods for designing matrix multiplication algorithms. Alman and Vassilevska Williams recently defined the Universal Method, which substantially generalizes all the known approaches including…
Recently, the joint probability density functions of complex eigenvalues for products of independent complex Ginibre matrices have been explicitly derived as determinantal point processes. We express truncated series coming from the…
Quantitative multivariate central limit theorems for general functionals of possibly non-symmetric and non-homogeneous infinite Rademacher sequences are proved by combining discrete Malliavin calculus with the smart path method for normal…
We consider a supercritical general branching population where the lifetimes of individuals are i.i.d. with arbitrary distribution and each individual gives birth to new individuals at Poisson times independently from each others. The…
We consider the spectral properties of a class of regularized estimators of (large) empirical covariance matrices corresponding to stationary (but not necessarily Gaussian) sequences, obtained by banding. We prove a law of large numbers…
This paper is concerned with the problem of finding a quadratic common Lyapunov function for a family of stable linear systems. We present gradient iteration algorithms which give deterministic convergence for finite system families and…
A law of large numbers and a central limit theorem are derived for linear statistics of random symmetric matrices whose on-or-above diagonal entries are independent, but neither necessarily identically distributed, nor necessarily all of…
We present a class of algorithms based on rational Krylov methods to compute the action of a generalized matrix function on a vector. These algorithms incorporate existing methods based on the Golub-Kahan bidiagonalization as a special…
We prove quenched versions of a central limit theorem, a large deviations principle as well as a local central limit theorem for expanding on average cocycles. This is achieved by building an appropriate modification of the spectral method…
Using Bernstein polynomial approximations, we prove the central limit theorem for linear spectral statistics of sample covariance matrices, indexed by a set of functions with continuous fourth order derivatives on an open interval including…
We prove a central limit theorem for the length of the longest subsequence of a random permutation which follows one of a class of repeating patterns. This class includes every fixed pattern of ups and downs having at least one of each,…
The Lanczos process constructs a sequence of orthonormal vectors v_m spanning a nested sequence of Krylov subspaces generated by a hermitian matrix A and some starting vector b. In this paper we show how to cheaply recover a secondary…
Consider Ginibre's ensemble of $N \times N$ non-Hermitian random matrices in which all entries are independent complex Gaussians of mean zero and variance $\frac{1}{N}$. As $N \uparrow \infty$ the normalized counting measure of the…
We study the Lanczos algorithm where the initial vector is sampled uniformly from $\mathbb{S}^{n-1}$. Let $A$ be an $n \times n$ Hermitian matrix. We show that when run for few iterations, the output of Lanczos on $A$ is almost…
We show that kernel-based quadrature rules for computing integrals can be seen as a special case of random feature expansions for positive definite kernels, for a particular decomposition that always exists for such kernels. We provide a…
We prove the Central Limit Theorem for the number of eigenvalues near the spectrum edge for hermitian ensembles of random matrices. To derive our results, we use a general theorem, essentially due to Costin and Lebowitz, concerning the…
We analyze the global convergence of the power iterates for the computation of a general mixed-subordinate matrix norm. We prove a new global convergence theorem for a class of entrywise nonnegative matrices that generalizes and improves a…