PageRank as a discrete Green's function
From MaRDI portal
Recommendations
Cited in
(14)- MPageRank: the stability of web graph
- Traditional and Lazy PageRanks for a line of nodes connected with complete graphs
- PageRank beyond the web
- \texttt{PageRank} and random walks on graphs
- Graph fibrations, graph isomorphism, and PageRank
- A Cheeger inequality of a distance regular graph using Green's function
- Chung-Yau invariants and graphs with symmetric hitting times
- Nonlocal pagerank
- Applications of Page Ranking in P Systems
- Ranking Websites: A Probabilistic View
- The Effect of New Links on Google Pagerank
- Network Capacity Bound for Personalized PageRank in Multimodal Networks
- On the relationship between PageRank and automorphisms of a graph
- Google PageRank as mean playing time for pinball on the reverse web
This page was built for publication: PageRank as a discrete Green's function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4647954)