Generalisation of the Damping Factor in PageRank for Weighted Networks
From MaRDI portal
Publication:3193136
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
Cites work
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- scientific article; zbMATH DE number 734901 (Why is no real title available?)
- scientific article; zbMATH DE number 3296351 (Why is no real title available?)
- Adaptive methods for the computation of PageRank
- The mathematics of internet search engines
Cited in
(7)- A Singular Perturbation Approach for Choosing the PageRank Damping Factor
- Black hole metric: overcoming the PageRank normalization problem
- Coupling and ergodic theorems for Markov chains with damping component
- Generic Damping Functions for Propagating Importance in Link-Based Ranking
- Perturbed Markov chains with damping component
- PageRank for networks, graphs, and Markov chains
- Asymptotic expansions for stationary distributions of perturbed semi-Markov processes
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)