Multilevel aggregation methods for small-world graphs with application to random-walk ranking

MaRDI QIDQ2973448zbMATH OpenFDO

Authors Van Emden Henson, H. De Sterck, Geoffrey Sanders

Publication date 3 April 2017

zbMATH Keywords

Markov chainrandom graphsmultilevel aggregation

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Numerical analysis or methods applied to Markov chains (65C40) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random walks on graphs (05C81)

Recommendations

• Multilevel Adaptive Aggregation for Markov Chains, with Application to Web Ranking
• Ranking Websites: A Probabilistic View
• Fast multilevel methods for Markov chains.
• Ranking nodes in general networks: a Markov multi-chain approach
• The extrapolation-accelerated multilevel aggregation method in PageRank computation

Cited in

(2)

• Numerical methods for Gremban's expansion of signed graphs
• Learning Optimal Multigrid Smoothers via Neural Networks

This page was built for publication: Multilevel aggregation methods for small-world graphs with application to random-walk ranking

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