Personalized PageRank clustering: a graph clustering algorithm based on random walks

DOI10.1016/j.physa.2013.07.021zbMath1395.05154OpenAlexW2080897802MaRDI QIDQ1673321

Maziar Abbasi, Masoud Asadpour, Shayan A. Tabrizi, Azadeh Shakery, Mohammad Ali Tavallaie

Publication date: 11 September 2018

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.physa.2013.07.021

zbMATH Keywords

clusteringrandom walkssocial networkscommunity detectionPageRank

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Graph algorithms (graph-theoretic aspects) (05C85) Internet topics (68M11) Random walks on graphs (05C81)

Related Items (4)

A divisive spectral method for network community detection ⋮ Extreme events in stochastic transport on networks ⋮ A divide-and-link algorithm for hierarchical clustering in networks ⋮ Network navigation with non-Lèvy superdiffusive random walks

Uses Software

• GraphBase
• Gephi
• Pregel

Cites Work

• Unnamed Item
• Unnamed Item
• Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
• Using PageRank to Locally Partition a Graph
• Community structure in social and biological networks
• Distributed Randomized Algorithms for the PageRank Computation
• Reducibility among Combinatorial Problems
• Fibonacci heaps and their uses in improved network optimization algorithms
• Fast unfolding of communities in large networks
• Computing Communities in Large Networks Using Random Walks
• Detecting Sharp Drops in PageRank and a Simplified Local Partitioning Algorithm
• Towards Scaling Fully Personalized PageRank: Algorithms, Lower Bounds, and Experiments

This page was built for publication: Personalized PageRank clustering: a graph clustering algorithm based on random walks