• Corpus ID: 211677527

Accelerating Power Methods for Higher-order Markov Chains

@article{Yu2020AcceleratingPM,
  title={Accelerating Power Methods for Higher-order Markov Chains},
  author={Gaohang Yu and Yi Zhou and Laishui Lv},
  journal={arXiv: Optimization and Control},
  year={2020}
}
Higher-order Markov chains play a very important role in many fields, ranging from multilinear PageRank to financial modeling. In this paper, we propose three accelerated higher-order power methods for computing the limiting probability distribution of higher-order Markov chains, namely higher-order power method with momentum and higher-order quadratic extrapolation method. The convergence results are established, and numerical experiments are reported to show the efficiency of the proposed… 
View PDF on arXiv

Figures and Tables from this paper

References

SHOWING 1-10 OF 30 REFERENCES

Relaxation methods for solving the tensor equation arising from the higher‐order Markov chains

It is shown that the new algorithms for solving the tensor equation arising from the higher‐order Markov chain and the multilinear PageRank are more efficient than the existing ones by some numerical experiments when relaxation parameters are chosen suitably.

ON THE LIMITING PROBABILITY DISTRIBUTION OF A TRANSITION PROBABILITY TENSOR

In this paper we propose and develop an iterative method to calculate a limiting probability distribution vector of a transition probability tensor P arising from a higher-order Markov chain. In the…

Multilinear PageRank

This paper first extends the celebrated PageRank modification to a higher-order Markov chain, then develops convergence theory for a simple fixed-point method, a shifted fixed- point method, and a Newton iteration in a particular parameter regime of multilinear PageRank.

Multilinear PageRank: Uniqueness, error bound and perturbation analysis

Extrapolation methods for fixed‐point multilinear PageRank computations

This work introduces an extrapolation‐based acceleration of power method type algorithms, namely, the shifted fixed‐point method and the inner‐outer method, and shows remarkably better performance, with faster convergence rates and reduced overall computational time.

A method for solving the convex programming problem with convergence rate O(1/k^2)

Fast computation of stationary joint probability distribution of sparse Markov chains

Tensor Analysis: Spectral Theory and Special Tensors

Limit Distribution of a High Order Markov Chain

On obtient la distribution limite d'une chaine de Markov d'ordre k>1 sous des conditions plus faibles que celles supposees par Raftery (1985)

Estimation and Modelling Repeated Patterns in High Order Markov Chains with the Mixture Transition Distribution Model

A computational algorithm for maximum likelihood estimation which is based on a way of reducing the large number of constraints is proposed and a very parsimonious version of this modified model is successfully applied to data representing bird songs.