Perron-based algorithms for the multilinear PageRank
From MaRDI portal
Publication:3120345
DOI10.1002/nla.2177OpenAlexW2963001932MaRDI QIDQ3120345
Federico Poloni, Beatrice Meini
Publication date: 1 March 2019
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1704.08072
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
Ergodicity Coefficients for Higher-Order Stochastic Processes ⋮ Higher Order Extended Dynamic Mode Decomposition Based on the Structured Total Least Squares ⋮ Multi-linear pseudo-PageRank for hypergraph partitioning ⋮ Truncated and sparse power methods with partially updating for large and sparse higher-order PageRank problems ⋮ Computing Tensor $Z$-Eigenvectors with Dynamical Systems ⋮ An SDP relaxation method for Perron pairs of a nonnegative tensor
This page was built for publication: Perron-based algorithms for the multilinear PageRank
