Sharp bounds for sums associated to graphs of matrices

DOI10.1016/J.JFA.2011.12.010zbMATH Open1250.15036arXiv0909.4277OpenAlexW2092460080MaRDI QIDQ765924FDOQ765924

Authors: Roland Speicher, James A. Mingo 

Publication date: 22 March 2012

Published in: Journal of Functional Analysis (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/0909.4277

Recommendations

• Sharp bounds on the permanental sum of a graph
• Note on Graphs and Matrix Inequalities
• scientific article; zbMATH DE number 2121221
• On sharp bounds for spectral radius of nonnegative matrices
• scientific article; zbMATH DE number 1877024

zbMATH Keywords

random matricesgraph of matricesgraph sumproduct of operator normsproducts of matrix entries

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random matrices (algebraic aspects) (15B52) Miscellaneous inequalities involving matrices (15A45) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60)

Cites Work

• Title not available (Why is that?)
• A limit theorem for the eigenvalues of product of two random matrices
• Title not available (Why is that?)

Cited In (14)

• Traffic distributions of random band matrices
• On the asymptotic distribution of singular values of powers of random matrices
• The traffic distribution of the squared unimodular random matrix and a formula for the moments of its ESD
• Asymptotic freeness of unitary matrices in tensor product spaces for invariant states
• Universality of approximate message passing algorithms and tensor networks
• Joint global fluctuations of complex Wigner and deterministic matrices
• Matrix denoising: Bayes-optimal estimators via low-degree polynomials
• The limiting distributions of large heavy Wigner and arbitrary random matrices
• Traffic distributions and independence. II: Universal constructions for traffic spaces
• A general solution to (free) deterministic equivalents
• Freeness over the diagonal for large random matrices
• Asymptotically well-behaved input states do not violate additivity for conjugate pairs of random quantum channels
• Traffic distributions and independence: permutation invariant random matrices and the three notions of independence
• Fluctuation moments induced by conjugation with asymptotically liberating random matrix ensembles

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)