Generalisation of the Damping Factor in PageRank for Weighted Networks

DOI10.1007/978-3-319-06653-0_19zbMATH Open1341.68135OpenAlexW66280366MaRDI QIDQ3193136FDOQ3193136

Authors: C. Engström, Sergei Silvestrov 

Publication date: 15 October 2015

Published in: EAA Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-06653-0_19

Recommendations

• Generalized PageRank on directed configuration networks
• Limit of PageRank with damping factor
• A Singular Perturbation Approach for Choosing the PageRank Damping Factor
• Pagerank asymptotics on directed preferential attachment networks
• Generic Damping Functions for Propagating Importance in Link-Based Ranking
• PageRank Computation, with Special Attention to Dangling Nodes
• PageRank for networks, graphs, and Markov chains
• PageRank of Scale-Free Growing Networks

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Internet topics (68M11)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Adaptive methods for the computation of PageRank
• Title not available (Why is that?)
• The mathematics of internet search engines

Cited In (7)

• Perturbed Markov chains with damping component
• Coupling and ergodic theorems for Markov chains with damping component
• Asymptotic expansions for stationary distributions of perturbed semi-Markov processes
• Generic Damping Functions for Propagating Importance in Link-Based Ranking
• PageRank for networks, graphs, and Markov chains
• Black hole metric: overcoming the PageRank normalization problem
• A Singular Perturbation Approach for Choosing the PageRank Damping Factor

This page was built for publication: Generalisation of the Damping Factor in PageRank for Weighted Networks

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