English
Related papers

Related papers: Norms of Randomized Circulant Matrices

200 papers

We exhibit an operator norm bounded, infinite sequence $\{A_n\}$ of $3n \times 3n$ complex matrices for which the commutator map $X\mapsto XA_n - A_nX$ is uniformly bounded below as an operator over the space of trace-zero self-adjoint…

Functional Analysis · Mathematics 2022-05-03 Garrett Mulcahy , Thomas Sinclair

Some new characterizations of nonnegative Hamiltonian operator matrices are given. Several necessary and sufficient conditions for an unbounded nonnegative Hamiltonian operators to be invertible are obtained; so that the main results in the…

Functional Analysis · Mathematics 2013-09-17 Guohai Jin , Guolin Hou , Alatancang Chen , Deyu Wu

We prove two universality results for random tensors of arbitrary rank D. We first prove that a random tensor whose entries are N^D independent, identically distributed, complex random variables converges in distribution in the large N…

Probability · Mathematics 2013-05-07 Razvan Gurau

Let $X=(x_{ij})\in\mathbb{R}^{N\times n}$ be a rectangular random matrix with i.i.d. entries (we assume $N/n\to\mathbf{a}>1$), and denote by $\sigma_{min}(X)$ its smallest singular value. When entries have mean zero and unit second moment,…

Probability · Mathematics 2025-07-30 Yi Han

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…

Functional Analysis · Mathematics 2022-11-16 Ángel Chávez , Stephan Ramon Garcia , Jackson Hurley

We establish new integral inequalities for the numerical radius and the operator norm of bounded linear operators on Hilbert spaces. Our results refine classical triangle-type and operator matrix inequalities by incorporating convex…

Functional Analysis · Mathematics 2026-02-17 Shiva Sheybani , Hamid Reza Moradi , Mohammad Sababheh

In this paper, we consider the inverse boundary value problem for the polyharmonic operator. We prove that the second order perturbations are uniquely determined by the corresponding Dirichlet to Neumann map. More precisely, we show in…

Analysis of PDEs · Mathematics 2022-09-27 Nesrine Aroua , Mourad Bellassoued

Given a real matrix A with n columns, the problem is to approximate the Gram product AA^T by c << n weighted outer products of columns of A. Necessary and sufficient conditions for the exact computation of AA^T (in exact arithmetic) from c…

Numerical Analysis · Mathematics 2014-05-16 John T. Holodnak , Ilse C. F. Ipsen

In this paper, moderate deviations for normal approximation of functionals over infinitely many Rademacher random variables are derived. They are based on a bound for the Kolmogorov distance between a general Rademacher functional and a…

Probability · Mathematics 2024-06-12 Marius Butzek , Peter Eichelsbacher , Benedikt Rednoß

We give, as $L$ grows to infinity, an explicit lower bound of order $L^{n/m}$ for the expected Betti numbers of the vanishing locus of a random linear combination of eigenvectors of $P$ with eigenvalues below $L$. Here, $P$ denotes an…

Spectral Theory · Mathematics 2016-04-20 Damien Gayet , Jean-Yves Welschinger

We give a simple proof of the matrix Spencer conjecture up to poly-logarithmic rank: given symmetric $d \times d$ matrices $A_1,\ldots,A_n$ each with $\|A_i\|_{\mathsf{op}} \leq 1$ and rank at most $n/\log^3 n$, one can efficiently find…

Data Structures and Algorithms · Computer Science 2022-08-30 Nikhil Bansal , Haotian Jiang , Raghu Meka

We derive a lower bound on the smallest singular value of a random $d$-regular matrix, that is, the adjacency matrix of a random $d$-regular directed graph. More precisely, let $C_1<d< c_1 n/\log^2 n$ and let $\mathcal{M}_{n,d}$ be the set…

In this note, we derive concentration inequalities for random vectors with subGaussian norm (a generalization of both subGaussian random vectors and norm bounded random vectors), which are tight up to logarithmic factors.

Probability · Mathematics 2019-02-12 Chi Jin , Praneeth Netrapalli , Rong Ge , Sham M. Kakade , Michael I. Jordan

The four moment theorem asserts, roughly speaking, that the joint distribution of a small number of eigenvalues of a Wigner random matrix (when measured at the scale of the mean eigenvalue spacing) depends only on the first four moments of…

Probability · Mathematics 2011-05-10 Terence Tao , Van Vu

In this paper, explicit error bounds are derived in the approximation of rank $k$ projections of certain $n$-dimensional random vectors by standard $k$-dimensional Gaussian random vectors. The bounds are given in terms of $k$, $n$, and a…

Probability · Mathematics 2007-06-07 Elizabeth Meckes

Let $X$ be a $d\times d$ symmetric random matrix with independent but non-identically distributed Gaussian entries. It has been conjectured by Lata\l{a} that the spectral norm of $X$ is always of the same order as the largest Euclidean norm…

Probability · Mathematics 2018-06-22 Ramon van Handel

This paper provides a general result on controlling local Rademacher complexities, which captures in an elegant form to relate the complexities with constraint on the expected norm to the corresponding ones with constraint on the empirical…

Artificial Intelligence · Computer Science 2015-10-07 Yunwen Lei , Lixin Ding , Yingzhou Bi

We present the two-loop corrected operator matrix elements calculated in N-dimensional regularization up to the finite terms which survive in the limit $\epsilon = N - 4 \to 0 $. The anomalous dimensions of the local operators have been…

High Energy Physics - Phenomenology · Physics 2009-10-31 Y. Matiounine , J. Smith , W. L. van Neerven

We develop new techniques for proving lower bounds on the least singular value of random matrices with limited randomness. The matrices we consider have entries that are given by polynomials of a few underlying base random variables. This…

Data Structures and Algorithms · Computer Science 2025-09-29 Aditya Bhaskara , Eric Evert , Vaidehi Srinivas , Aravindan Vijayaraghavan

We present a method for randomizing formulas for bilinear computation of matrix products. We consider the implications of such randomization when there are two sources of error: One due to the formula itself only being approximately…

Data Structures and Algorithms · Computer Science 2022-01-11 Osman Asif Malik , Stephen Becker
‹ Prev 1 4 5 6 7 8 10 Next ›