English
Related papers

Related papers: Random weighted projections, random quadratic form…

200 papers

We study a class of random matrices that appear in several communication and signal processing applications, and whose asymptotic eigenvalue distribution is closely related to the reconstruction error of an irregularly sampled bandlimited…

Information Theory · Computer Science 2008-06-24 Alessandro Nordio , Carla-Fabiana Chiasserini , Emanuele Viterbo

We study eigenfunction localization for higher dimensional cat maps, a popular model of quantum chaos. These maps are given by linear symplectic maps in ${\mathrm{Sp}}(2g,\mathbb Z)$, which we take to be ergodic. Under some natural…

Dynamical Systems · Mathematics 2025-09-03 Pär Kurlberg , Alina Ostafe , Zeev Rudnick , Igor E. Shparlinski

The aim of this paper is to establish the Marcinkiewicz-Zygmund (MZ) type law of large numbers for the randomly weighted sums with weights chosen randomly, uniformly over the unit sphere in $\mathbb{R}^n$. We also establish a theorem that…

Probability · Mathematics 2025-05-20 Vishakha

We study the long-term behavior of weighted multi-type branching processes, focusing on extending classical laws of large numbers and martingale convergence to settings with infinitely many weighted particles, arbitrary type spaces and…

Probability · Mathematics 2025-12-09 Denis Villemonais , Nicolas Zalduendo

We consider the eigenvalues and eigenvectors of finite, low rank perturbations of random matrices. Specifically, we prove almost sure convergence of the extreme eigenvalues and appropriate projections of the corresponding eigenvectors of…

Probability · Mathematics 2012-03-19 Florent Benaych-Georges , Raj Rao Nadakuditi

A sum of a large-dimensional random matrix polynomial and a fixed low-rank matrix polynomial is considered. The main assumption is that the resolvent of the random polynomial converges to some deterministic limit. A formula for the limit of…

Probability · Mathematics 2022-05-23 Patryk Pagacz , Michał Wojtylak

We prove that probability laws of certain multidimensional semimartingales which includes time-inhomogenous diffusions, under suitable assumptions, satisfy Quadratic Transportation Cost Inequality under the uniform metric. From this we…

Probability · Mathematics 2011-04-22 Soumik Pal

A concentration result for quadratic form of independent subgaussian random variables is derived. If the moments of the random variables satisfy a "Bernstein condition", then the variance term of the Hanson-Wright inequality can be…

Statistics Theory · Mathematics 2019-01-28 Pierre C Bellec

Neural networks have been used successfully in a variety of fields, which has led to a great deal of interest in developing a theoretical understanding of how they store the information needed to perform a particular task. We study the…

Disordered Systems and Neural Networks · Physics 2022-11-16 Matthias Thamm , Max Staats , Bernd Rosenow

We present first-order perturbation analysis of a simple eigenvalue and the corresponding right and left eigenvectors of a general square matrix, not assumed to be Hermitian or normal. The eigenvalue result is well known to a broad…

Numerical Analysis · Mathematics 2019-06-04 Anne Greenbaum , Ren-cang Li , Michael L. Overton

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…

Probability · Mathematics 2019-02-01 Kyle Luh , Sean O'Rourke

Random matrix ensembles are introduced that respect the local tensor structure of Hamiltonians describing a chain of $n$ distinguishable spin-half particles with nearest-neighbour interactions. We prove a central limit theorem for the…

Mathematical Physics · Physics 2017-06-19 J. P. Keating , N. Linden , H. J. Wells

We consider a general class of random matrices whose entries are centred random variables, independent up to a symmetry constraint. We establish precise high-probability bounds on the averages of arbitrary monomials in the resolvent matrix…

Probability · Mathematics 2015-06-05 Laszlo Erdos , Antti Knowles , Horng-Tzer Yau

Central limit theorems for the log-volume of a class of random convex bodies in $\mathbb{R}^n$ are obtained in the high-dimensional regime, that is, as $n\to\infty$. In particular, the case of random simplices pinned at the origin and…

Random Hermitian matrices are used to model complex systems without time-reversal invariance. Adding an external source to the model can have the effect of shifting some of the matrix eigenvalues, which corresponds to shifting some of the…

Mathematical Physics · Physics 2015-05-20 Marco Bertola , Robert Buckingham , Seung-Yeop Lee , Virgil U. Pierce

We show the density of eigenvalues for three classes of random matrix ensembles is determinantal. First we derive the density of eigenvalues of product of $k$ independent $n\times n$ matrices with i.i.d. complex Gaussian entries with a few…

Probability · Mathematics 2016-05-05 Kartick Adhikari , Nanda Kishore Reddy , Tulasi Ram Reddy , Koushik Saha

This paper studies projections of uniform random elements of (co)adjoint orbits of compact Lie groups. Such projections generalize several widely studied ensembles in random matrix theory, including the randomized Horn's problem, the…

Mathematical Physics · Physics 2023-10-25 Benoît Collins , Colin McSwiggen

We obtain the matter-graviton scattering amplitude in the gravitational theory of quadratic curvature, which has $R_{\mu\nu}^2$ term in the action. Unitarity bound is not satisfied because of the existence of negative norm states, while an…

High Energy Physics - Theory · Physics 2023-04-12 Yugo Abe , Takeo Inami , Keisuke Izumi

McKay proved that the limiting spectral measures of the ensembles of $d$-regular graphs with $N$ vertices converge to Kesten's measure as $N\to\infty$. In this paper we explore the case of weighted graphs. More precisely, given a large…

Probability · Mathematics 2013-07-01 Leo Goldmakher , Cap Khoury , Steven J. Miller , Kesinee Ninsuwan

In many areas of machine learning, it becomes necessary to find the eigenvector decompositions of large matrices. We discuss two methods for reducing the computational burden of spectral decompositions: the more venerable Nystom extension…

Machine Learning · Statistics 2011-07-22 Darren Homrighausen , Daniel J. McDonald