Ranking nodes in general networks: a Markov multi-chain approach

DOI10.1007/s10626-017-0248-7zbMath1384.93138OpenAlexW2620111902MaRDI QIDQ1745939

Bernd F. Heidergott, Joost Berkhout

Publication date: 18 April 2018

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/25809

zbMATH Keywords

Google's pagerankMarkov multi-chainsrandom surferranking nodes in networks

Mathematics Subject Classification ID

Stochastic ordinary differential equations (aspects of stochastic analysis) (60H10) Stochastic systems in control theory (general) (93E03) Applications of graph theory to circuits and networks (94C15)

Related Items (1)

Analysis of Markov Influence Graphs

Uses Software

• SNAP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Choose the damping, choose the ranking?
• PageRank Beyond the Web
• A Singular Perturbation Approach for Choosing the PageRank Damping Factor
• The Role of the Group Generalized Inverse in the Theory of Finite Markov Chains
• Deeper Inside PageRank
• Axioms for Centrality
• A Survey of Eigenvector Methods for Web Information Retrieval
• SERIES EXPANSIONS FOR FINITE-STATE MARKOV CHAINS
• Damping factor in Google page ranking
• Paradoxical Effects in PageRank Incremental Computations
• The Effect of New Links on Google Pagerank
• Depth-First Search and Linear Graph Algorithms
• A Survey on PageRank Computing

This page was built for publication: Ranking nodes in general networks: a Markov multi-chain approach