Multilinear PageRank

DOI10.1137/140985160zbMath1330.15029arXiv1409.1465OpenAlexW3037346199MaRDI QIDQ3456870

Lek-Heng Lim, David F. Gleich, Yongyang Yu

Publication date: 9 December 2015

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1409.1465

zbMATH Keywords

tensorgraphsPageRankhypermatrixhigher-order Markov chainsmultilinear PageRankhigher-order PageRankspacey random surfertensor PageRank

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Numerical computation of solutions to systems of equations (65H10) Hypergraphs (05C65) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Multilinear algebra, tensor calculus (15A69) Stochastic matrices (15B51) Random walks on graphs (05C81)

Related Items

Ergodicity Coefficients for Higher-Order Stochastic Processes ⋮ Further study on tensor absolute value equations ⋮ Continuation methods for computing Z-/H-eigenpairs of nonnegative tensors ⋮ Unnamed Item ⋮ Higher Order Extended Dynamic Mode Decomposition Based on the Structured Total Least Squares ⋮ Fast computation of stationary joint probability distribution of sparse Markov chains ⋮ Nonlinear Perron--Frobenius Theorems for Nonnegative Tensors ⋮ Spectral computation with third-order tensors using the t-product ⋮ Semidefinite Relaxation Methods for Tensor Absolute Value Equations ⋮ Some inequalities on the spectral radius of nonnegative tensors ⋮ A Necessary and Sufficient Condition for Existence of a Positive Perron Vector ⋮ What Are Higher-Order Networks? ⋮ Multi-linear pseudo-PageRank for hypergraph partitioning ⋮ On classification of states in higher order Markov chains ⋮ Truncated and sparse power methods with partially updating for large and sparse higher-order PageRank problems ⋮ Vector Aitken extrapolation method for multilinear PageRank computations ⋮ Nonnegative tensors revisited: plane stochastic tensors ⋮ A modified Newton iteration for finding nonnegative \(Z\)-eigenpairs of a nonnegative tensor ⋮ Unnamed Item ⋮ Markov chains with memory, tensor formulation, and the dynamics of power iteration ⋮ A modified Newton method for multilinear PageRank ⋮ Computing the largest H-eigenvalue of large-scale tensors generated from directed hypergraphs ⋮ The Spacey Random Walk: A Stochastic Process for Higher-Order Data ⋮ Generalized tensor equations with leading structured tensors ⋮ On the spectrum of two-layer approach and multiplex PageRank ⋮ Uniqueness and perturbation bounds for sparse non-negative tensor equations ⋮ Computing Tensor $Z$-Eigenvectors with Dynamical Systems ⋮ A survey of Shanks' extrapolation methods and their applications ⋮ On identifiability of higher order block term tensor decompositions of rank L_r⊗ rank-1 ⋮ PageRank Beyond the Web ⋮ A residual-based error bound for the multilinear PageRank vector ⋮ A general preconditioner accelerated SOR-type iterative method for multi-linear systems with \(\mathcal{Z}\)-tensors ⋮ Triangular decomposition of CP factors of a third-order tensor with application to solving nonlinear systems of equations ⋮ Computing Eigenvalues of Large Scale Sparse Tensors Arising from a Hypergraph ⋮ Ergodicity of $p$-majorizing nonlinear Markov operators on the finite dimensional space ⋮ New uniqueness conditions for the stationary probability matrix of transition probability tensors ⋮ A new modified Newton iteration for computing nonnegative \(Z\)-eigenpairs of nonnegative tensors ⋮ Three Hypergraph Eigenvector Centralities ⋮ An SDP relaxation method for Perron pairs of a nonnegative tensor

Uses Software

• GeneRank

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Perron-Frobenius theorem for nonnegative tensors
• Vertex-reinforced random walk
• Vertex-reinforced random walks and a conjecture of Pemantle
• Perron-Frobenius theorem for nonnegative multilinear forms and extensions
• Solving sparse non-negative tensor equations: algorithms and applications
• Bounded-rank tensors are defined in bounded degree
• Eigenvalues of a real supersymmetric tensor
• When are Overcomplete Topic Models Identifiable? Uniqueness of Tensor Tucker Decompositions with Structured Sparsity
• PageRank Beyond the Web
• Semidefinite Relaxations for Best Rank-1 Tensor Approximations
• An Inner-Outer Iteration for Computing PageRank
• Shifted Power Method for Computing Tensor Eigenpairs
• Traps and Pitfalls of Topic-Biased PageRank
• The Spacey Random Walk: A Stochastic Process for Higher-Order Data