Open Access
2012 Finding and Visualizing Graph Clusters Using PageRank Optimization
Fan Chung, Alexander Tsiatas
Internet Math. 8(1-2): 46-72 (2012).


We give algorithms for finding graph clusters and drawing graphs, highlighting local community structure within the context of a larger network. For a given graph G, we use the personalized PageRank vectors to determine a set of clusters, by optimizing the jumping parameter α subject to several cluster variance measures in order to capture the graph structure according to PageRank. We then give a graph visualization algorithm for the clusters using PageRank-based coordinates. Several drawings of real-world data are given, illustrating the partition and local community structure.


Download Citation

Fan Chung. Alexander Tsiatas. "Finding and Visualizing Graph Clusters Using PageRank Optimization." Internet Math. 8 (1-2) 46 - 72, 2012.


Published: 2012
First available in Project Euclid: 14 June 2012

zbMATH: 1245.68146
MathSciNet: MR2900489

Rights: Copyright © 2012 A K Peters, Ltd.

Vol.8 • No. 1-2 • 2012
Back to Top