English
Related papers

Related papers: Hanson-Wright Inequality for Random Tensors under …

200 papers

In this work, we try to build a theory for random double tensor integrals (DTI). We begin with the definition of DTI and discuss how randomness structure is built upon DTI. Then, the tail bound of the unitarily invariant norm for the random…

Probability · Mathematics 2022-04-06 Shih Yu Chang

We study the extent of independence needed to approximate the product of bounded random variables in expectation, a natural question that has applications in pseudorandomness and min-wise independent hashing. For random variables whose…

Computational Complexity · Computer Science 2015-08-12 Parikshit Gopalan , Amir Yehudayoff

We consider random matrices of the form $H_N=A_N+U_N B_N U^*_N$, where $A_N$, $B_N$ are two $N$ by $N$ deterministic Hermitian matrices and $U_N$ is a Haar distributed random unitary matrix. We establish a universal Central Limit Theorem…

Probability · Mathematics 2020-08-20 Zhigang Bao , Kevin Schnelli , Yuanyuan Xu

The Chernoff bound is an important inequality relation in probability theory. The original version of the Chernoff bound is to give an exponential decreasing bound on the tail distribution of sums of independent random variables. Recent…

Probability · Mathematics 2021-05-18 Shih Yu Chang

In this article we obtain an "off-diagonal" version of the Fefferman-Stein vector-valued maximal inequality on weighted Lebesgue spaces with variable exponents. As an application of this result and the atomic decomposition developed in [12]…

Classical Analysis and ODEs · Mathematics 2022-11-28 Pablo Rocha

Normalized eigenvalue counting measure of the sum of two Hermitian (or real symmetric) matrices $A_{n}$ and $B_{n}$ rotated independently with respect to each other by the random unitary (or orthogonal) Haar distributed matrix $U_{n}$ (i.e.…

Mathematical Physics · Physics 2016-08-15 L. Pastur , V. Vasilchuk

Large families of Hamiltonians that are non-Hermitian in the conventional sense have been found to have all eigenvalues real, a fact attributed to an unbroken PT symmetry. The corresponding quantum theories possess an unconventional scalar…

Quantum Physics · Physics 2009-11-11 Zafar Ahmed , Carl M. Bender , M. V. Berry

We construct a new tail bound for the sum of independent random variables for situations in which the expected value of the sum is known and each random variable lies within a specified interval, which may be different for each variable.…

Probability · Mathematics 2025-03-25 Jackson Loper , Jeffrey Regier

We obtain so far unproved properties of a ratio involving a class of Hermite and parabolic cylinder functions. Those ratios are shown to be strictly decreasing and bounded by universal constants. Differently to usual analytic approaches, we…

Classical Analysis and ODEs · Mathematics 2019-05-27 Torben Koch

We prove the universality of the joint distribution of an eigenvalue and the corresponding diagonal eigenvector overlap, in the bulk and at the edge, for eigenvalues of complex matrices and real eigenvalues of real matrices. As part of the…

Probability · Mathematics 2025-01-03 Mohammed Osman

The classical Hermitian eigenvalue problem addresses the following question: What are the possible eigenvalues of the sum A+B of two Hermitian matrices A and B, provided we fix the eigenvalues of A and B. A systematic study of this problem…

Algebraic Geometry · Mathematics 2013-05-22 Shrawan Kumar

We develop a unified approach to bounding the largest and smallest singular values of an inhomogeneous random rectangular matrix, based on the non-backtracking operator and the Ihara-Bass formula for general random Hermitian matrices with a…

Probability · Mathematics 2024-12-13 Ioana Dumitriu , Yizhe Zhu

In this paper, we establish the existence of extremals for two kinds of Stein-Weiss inequalities on the Heisenberg group. More precisely, we prove the existence of extremals for the Stein-Weiss inequalities with full weights in Theorem 1.1…

Classical Analysis and ODEs · Mathematics 2019-01-18 Lu Chen , Guozhen Lu , Chunxia Tao

We give Hoeffding and Bernstein-type concentration inequalities for the largest eigenvalue of sums of random matrices arising from a Markov chain. We consider time-dependent matrix-valued functions on a general state space, generalizing…

Probability · Mathematics 2025-07-01 Joe Neeman , Bobby Shi , Rachel Ward

Subspace methods are commonly used for finding approximate eigenvalues and singular values of large-scale matrices. Once a subspace is found, the Rayleigh-Ritz method (for symmetric eigenvalue problems) and Petrov-Galerkin projection (for…

Numerical Analysis · Mathematics 2025-10-07 Irina-Beatrice Haas , Yuji Nakatsukasa

Let $M_n= \fsu X1n$ be a sum of independent random variables such that $ X_k\leq 1$, $\E X_k =0$ and $\E X_k^2=\s_k^2$ for all $k$. Hoeffding 1963, Theorem 3, proved that $$\P{M_n \geq nt}\leq H^n(t,p),\quad H(t,p)= \bgl(1+qt/p\bgr)^{p +qt}…

Probability · Mathematics 2011-11-29 Vidmantas Bentkus , Tomas Juškevičius

The Rayleigh-Ritz method is widely used for eigenvalue approximation. Given a matrix $X$ with columns that form an orthonormal basis for a subspace $\X$, and a Hermitian matrix $A$, the eigenvalues of $X^HAX$ are called Ritz values of $A$…

Numerical Analysis · Mathematics 2008-05-16 M. E. Argentati , A. V. Knyazev , C. C. Paige , I. Panayotov

We study probability inequalities leading to tail estimates in a general semigroup $\mathscr{G}$ with a translation-invariant metric $d_{\mathscr{G}}$. (An important and central example of this in the functional analysis literature is that…

Probability · Mathematics 2020-07-27 Apoorva Khare , Bala Rajaratnam

Chebyshev's inequality provides an upper bound on the tail probability of a random variable based on its mean and variance. While tight, the inequality has been criticized for only being attained by pathological distributions that abuse the…

Optimization and Control · Mathematics 2020-10-16 Ernst Roos , Ruud Brekelmans , Wouter van Eekelen , Dick den Hertog , Johan van Leeuwaarden

A device-independent randomness expansion protocol aims to take an initial random string and generate a longer one, where the security of the protocol does not rely on knowing the inner workings of the devices used to run it. In order to do…

Quantum Physics · Physics 2026-01-06 Rutvij Bhavsar , Sammy Ragy , Roger Colbeck