On the initial value of PageRank

DOI10.1142/S0219525924500073MaRDI QIDQ6671244zbMATH OpenFDO

Authors Krishanu Deyasi

Publication date 24 January 2025

Published in Advances in Complex Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0219525924500073

zbMATH Keywords

complex networksinitial conditionslocalizationPageRank

Mathematics Subject Classification ID

Game theory, economics, finance, and other social and behavioral sciences (91-XX)

Cites work

• A local graph partitioning algorithm using heat kernel pagerank
• A note on the PageRank of undirected graphs
• Collective dynamics of `small-world' networks
• Deeper Inside PageRank
• Emergence of Scaling in Random Networks
• Ergodic Control and Polyhedral Approaches to PageRank Optimization
• Graph spectra for complex networks
• Localized eigenvectors of the non-backtracking matrix
• Maximizing PageRank via outlinks
• Network science. With Márton Pósfai
• Networks. An introduction.
• PageRank beyond the web
• Peculiarities of random walks with resetting in a one-dimensional chain
• Perron vector optimization applied to search engines
• Random graphs.
• Random walks on complex networks under node-dependent stochastic resetting
• RANDOM WALKS ON DIRECTED NETWORKS: THE CASE OF PAGERANK
• Spectral properties of Google matrix of Wikipedia and other networks
• Statistical mechanics of complex networks
• The Effect of New Links on Google Pagerank
• The Structure and Function of Complex Networks

This page was built for publication: On the initial value of PageRank

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