Higher-order ergodicity coefficients for stochastic tensors

07/10/2019
by   Dario Fasino, et al.
0

Ergodicity coefficients for stochastic matrices provide valuable upper bounds for the magnitude of subdominant eigenvalues, allow to bound the convergence rate of methods for computing the stationary distribution and can be used to estimate the sensitivity of the stationary distribution to changes in the matrix. In this work we extend an important class of ergodicity coefficients defined in terms of the 1-norm to the setting of stochastic tensors. We show that the proposed higher-order ergodicity coefficients provide new explicit formulas that (a) guarantee the uniqueness of Perron Z-eigenvectors of stochastic tensors, (b) provide bounds on the sensitivity of such eigenvectors with respect to changes in the tensor and (c) ensure the convergence of different types of higher-order power methods to the stationary distribution of higher-order and vertex-reinforced Markov chains.

READ FULL TEXT
research
07/10/2019

Higher-order ergodicity coefficients

Ergodicity coefficients for stochastic matrices provide valuable upper b...
research
07/17/2020

Perturbation Bounds for Orthogonally Decomposable Tensors and Their Applications in High Dimensional Data Analysis

We develop deterministic perturbation bounds for singular values and vec...
research
07/21/2023

Accelerating the Computation of Tensor Z-eigenvalues

Efficient solvers for tensor eigenvalue problems are important tools for...
research
06/10/2016

Incoherent Tensor Norms and Their Applications in Higher Order Tensor Completion

In this paper, we investigate the sample size requirement for a general ...
research
05/10/2023

On the tubular eigenvalues of third-order tensors

This paper introduces the notion of tubular eigenvalues of third-order t...
research
05/02/2018

Computing tensor Z-eigenvectors with dynamical systems

We present a new framework for computing Z-eigenvectors of general tenso...
research
02/15/2020

Higher order co-occurrence tensors for hypergraphs via face-splitting

A popular trick for computing a pairwise co-occurrence matrix is the pro...

Please sign up or login with your details

Forgot password? Click here to reset