Truncated and sparse power methods with partially updating for large and sparse higher-order PageRank problems
From MaRDI portal
Publication:6159014
DOI10.1007/s10915-023-02146-0zbMath1515.65080arXiv2105.03874OpenAlexW4323567536MaRDI QIDQ6159014
Publication date: 20 June 2023
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.03874
higher-order Markov chaintruncated power methodhigher-order PageRankmultilinear pagerankpartially updating strategy
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast computation of stationary joint probability distribution of sparse Markov chains
- A modified Newton method for multilinear PageRank
- Perron vector analysis for irreducible nonnegative tensors and its applications
- Multilinear PageRank: uniqueness, error bound and perturbation analysis
- Solving sparse non-negative tensor equations: algorithms and applications
- Higher-order multivariate Markov chains and their applications
- PageRank Beyond the Web
- Perron-based algorithms for the multilinear PageRank
- Higher-order Markov chain models for categorical data sequences
- Multilinear PageRank
- The uniqueness of multilinear PageRank vectors
- A Preconditioned and Shifted GMRES Algorithm for the PageRank Problem with Multiple Damping Factors
- Convergence of the fixed‐point iteration for multilinear PageRank
- Stationary Distributions of Continuous-Time Markov Chains: A Review of Theory and Truncation-Based Approximations
- Relaxation methods for solving the tensor equation arising from the higher‐order Markov chains
- A residual-based error bound for the multilinear PageRank vector
- Extrapolation methods for fixed‐point multilinear PageRank computations
- On the limiting probability distribution of a transition probability tensor
This page was built for publication: Truncated and sparse power methods with partially updating for large and sparse higher-order PageRank problems