Sharp bounds for sums associated to graphs of matrices
From MaRDI portal
Abstract: We provide a simple algorithm for finding the optimal upper bound for sums of products of matrix entries of the form S_pi(N) := sum_{j_1, ..., j_2m = 1}^N t^1_{j_1 j_2} t^2_{j_3 j_4} ... t^m_{j_2m-1 j_2m} where some of the summation indices are constrained to be equal. The upper bound is easily obtained from a graph G associated to the constraints in the sum.
The authors find a sharp upper bound for sums of products of matrix entries of the form \[ S_\pi (N)=\sum_{j_1,\dots, j_{2m}=1,ker (j)\geq \pi}^N t^{(1)}_{j_1j_2}\dots t^{(m)}_{j_{2m-1}j_{2m}} \] in terms of product of operator norms. The problem is motivated by random matrix questions and the solution uses graph theory.
Recommendations
Cites work
Cited in
(16)- The traffic distribution of the squared unimodular random matrix and a formula for the moments of its ESD
- Traffic distributions of random band matrices
- Freeness over the diagonal for large random matrices
- Asymptotically well-behaved input states do not violate additivity for conjugate pairs of random quantum channels
- On the asymptotic distribution of singular values of powers of random matrices
- The limiting distributions of large heavy Wigner and arbitrary random matrices
- Traffic distributions and independence: permutation invariant random matrices and the three notions of independence
- A general solution to (free) deterministic equivalents
- Joint global fluctuations of complex Wigner and deterministic matrices
- Fluctuation moments induced by conjugation with asymptotically liberating random matrix ensembles
- Asymptotic freeness of unitary matrices in tensor product spaces for invariant states
- Traffic distributions and independence. II: Universal constructions for traffic spaces
- Universality of approximate message passing algorithms and tensor networks
- Matrix denoising: Bayes-optimal estimators via low-degree polynomials
- Random permutation matrix models for graph products
- Subspace embeddings with the rerandomized SRHT
This page was built for publication: Sharp bounds for sums associated to graphs of matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765924)
