Mean field analysis of personalized PageRank with implications for local graph clustering
From MaRDI portal
Publication:1756549
DOI10.1007/s10955-018-2099-5zbMath1475.60133arXiv1806.07640OpenAlexW2808774281MaRDI QIDQ1756549
Arun Kadavankandy, Nelly Litvak, Konstantin E. Avrachenkov
Publication date: 21 December 2018
Published in: Journal of Statistical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1806.07640
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)
Related Items (1)
Cites Work
- Unnamed Item
- A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning
- Information ranking and power laws on trees
- A Singular Perturbation Approach for Choosing the PageRank Damping Factor
- Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
- Almost Optimal Local Graph Clustering Using Evolving Sets
- PageRank in Undirected Random Graphs
- Asymptotic analysis for personalized Web search
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
- Random Walks and Evolving Sets: Faster Convergences and Limitations
- The Power of Side-Information in Subgraph Detection
- Deeper Inside PageRank
- Generalized PageRank on directed configuration networks
- Distribution of PageRank Mass Among Principle Components of the Web
- The Effect of New Links on Google Pagerank
- PageRank of Scale-Free Growing Networks
- On Local Estimations of PageRank: A Mean Field Approach
This page was built for publication: Mean field analysis of personalized PageRank with implications for local graph clustering