Hoffmann-Jørgensen Inequalities for Random Walks on the Cone of Positive Definite Matrices

06/21/2022
by   Armine Bagyan, et al.
0

We consider random walks on the cone of m × m positive definite matrices, where the underlying random matrices have orthogonally invariant distributions on the cone and the Riemannian metric is the measure of distance on the cone. By applying results of Khare and Rajaratnam (Ann. Probab., 45 (2017), 4101–4111), we obtain inequalities of Hoffmann-Jørgensen type for such random walks on the cone. In the case of the Wishart distribution W_m(a,I_m), with index parameter a and matrix parameter I_m, the identity matrix, we derive explicit and computable bounds for each term appearing in the Hoffmann-Jørgensen inequalities.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/26/2023

Permutation Inequalities for Walks in Graphs

Using spectral graph theory, we show how to obtain inequalities for the ...
research
06/28/2022

Affine-Invariant Midrange Statistics

We formulate and discuss the affine-invariant matrix midrange problem on...
research
03/09/2019

Two-Hop Walks Indicate PageRank Order

This paper shows that pairwise PageRank orders emerge from two-hop walks...
research
05/10/2022

Dimension Walks on Generalized Spaces

Let d,k be positive integers. We call generalized spaces the cartesian p...
research
02/02/2022

Efficient Random Walks on Riemannian Manifolds

According to a version of Donsker's theorem, geodesic random walks on Ri...
research
10/08/2019

On Dimension-free Tail Inequalities for Sums of Random Matrices and Applications

In this paper, we present a new framework to obtain tail inequalities fo...
research
03/04/2021

Weisfeiler–Leman, Graph Spectra, and Random Walks

The Weisfeiler–Leman algorithm is a ubiquitous tool for the Graph Isomor...

Please sign up or login with your details

Forgot password? Click here to reset