The uniqueness of multilinear PageRank vectors.

DOI10.1002/NLA.2107MaRDI QIDQ4599022zbMATH OpenOpenAlexWikidataFDO

Authors Dongdong Liu, Wen Li, Michael Ng, Seak-Weng Vong

Publication date 15 December 2017

Published in Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nla.2107

zbMATH Keywords

multilinear PageRankmultilinear PageRank vectorstochastic tensor

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Stochastic matrices (15B51) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Computational methods for sparse matrices (65F50)

Recommendations

• Multilinear PageRank: uniqueness, error bound and perturbation analysis
• Multilinear PageRank
• Vector Aitken extrapolation method for multilinear PageRank computations
• A residual-based error bound for the multilinear PageRank vector
• A modified Newton method for multilinear PageRank

Cited in

(24)

• The tensor splitting with application to solve multi-linear systems
• Uniqueness and perturbation bounds for sparse non-negative tensor equations
• A modified Newton method for multilinear PageRank
• A general preconditioner accelerated SOR-type iterative method for multi-linear systems with \(\mathcal{Z}\)-tensors
• New uniqueness conditions for the stationary probability matrix of transition probability tensors
• Multilinear PageRank: uniqueness, error bound and perturbation analysis
• Ergodicity of $p$-majorizing nonlinear Markov operators on the finite dimensional space
• Vector Aitken extrapolation method for multilinear PageRank computations
• Multilinear PageRank
• Ergodicity Coefficients for Higher-Order Stochastic Processes
• A residual-based error bound for the multilinear PageRank vector
• Numerical computation for orthogonal low-rank approximation of tensors
• A refined bound for the Z1-spectral radius of tensors
• Multi-linear pseudo-PageRank for hypergraph partitioning
• Truncated and sparse power methods with partially updating for large and sparse higher-order PageRank problems
• Improved uniqueness conditions of solution for multilinear pagerank and its application
• The MFPIO iteration and the FPMPE method for multilinear PageRank computations
• Extrapolation methods for multilinear PageRank
• Weak dangling block reordering and multi-step block compression for efficiently computing and updating PageRank solutions
• The projected Newton iteration approach for computing the nonnegative Z-eigenpairs of nonnegative tensors
• Geršhgorin-type theorems for Z₁-eigenvalues of tensors with applications
• Spliting iteration method for solving multilinear PageRank problem
• Preconditioned iterative methods with Anderson acceleration for solving multilinear PageRank and applications
• Optimal Z₁-eigenvalue inclusion intervals for tensors and their application

Describes a project that uses

Uses Software

• Matlab

This page was built for publication: The uniqueness of multilinear PageRank vectors.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4599022)