Local Graph Partitioning using PageRank Vectors
Abstract
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than the size of the input graph. In this paper, we present a local partitioning algorithm using a variation of PageRank with a specified starting distribution. We derive a mixing result for PageRank vectors similar to that for random walks, and show that the ordering of the vertices produced by a PageRank vector reveals a cut with small conductance. In particular, we show that for any set C with conductance Phi and volume k, a PageRank vector with a certain starting distribution can be used to produce a set with conductance (O(radic(Phi log k)). We present an improved algorithm for computing approximate PageRank vectors, which allows us to find such a set in time proportional to its size. In particular, we can find a cut with conductance at most oslash, whose small side has volume at least 2bin time O(2 log m/(2blog2m/oslash2) where m is the number of edges in the graph. By combining small sets found by this local partitioning algorithm, we obtain a cut with conductance oslash and approximately optimal balance in time O(m log4m/oslash)
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Cites
The anatomy of a large-scale hypertextual Web search engine
Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004 · see citing works
(1999) · Cited by 12,854 · see citing works
Scaling personalized web search
Jeh, G., & Widom, J. (2003) · Proceedings of the twelfth international conference on World Wide Web - WWW '03 · doi:10.1145/775152.775191 · Cited by 1,195 · see citing works
Topic-sensitive pagerank: A context-sensitive ranking algorithm for web search
Haveliwala, T. H. (2003) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2003.1208999 · Cited by 1,046 · see citing works
Kannan, R., Vempala, S., & Vetta, A. R. (2004) · Journal of the ACM · doi:10.1145/990308.990313 · Cited by 857 · see citing works
Spielman, D. A., & Teng, S. (2004) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1007352.1007372 · Cited by 803 · see citing works
Schlenk, F. (2005) · De Gruyter eBooks · doi:10.1515/9783110199697.107 · Cited by 461 · see citing works
Adleman, L. M., & Huang, M.-D. A. (1992) · Lecture notes in mathematics · doi:10.1007/bfb0090191 · Cited by 437 · see citing works
SPECTRAL GRAPH THEORY (CBMS Regional Conference Series in Mathematics 92)
Biggs, N. (1998) · Bulletin of the London Mathematical Society · doi:10.1112/s0024609397223611 · Cited by 437 · see citing works
Random walks in a convex body and an improved volume algorithm
Lovász, L., & Simonovits, M. (1993) · Random Structures and Algorithms · doi:10.1002/rsa.3240040402 · Cited by 424 · see citing works
Spectral partitioning works: planar graphs and finite element meshes
Spielman, D. A., & Teng, S. (1996) · doi:10.1109/sfcs.1996.548468 · Cited by 410 · see citing works
Leighton, T., & Rao, S. (1988) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1988.21958 · Cited by 398 · see citing works
Edrei, A., Saff, E. B., & Varga, R. S. (1983) · Lecture notes in mathematics · doi:10.1007/bfb0070484 · Cited by 276 · see citing works
Adleman, L. M., & Huang, M.-D. A. (1992) · Lecture notes in mathematics · doi:10.1007/bfb0090190 · Cited by 258 · see citing works
How Good is Recursive Bisection?
Simon, H. D., & Teng, S. (1997) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827593255135 · Cited by 227 · see citing works
The mixing rate of Markov chains, an isoperimetric inequality, and computing the volume
Lovász, L., & Simonovits, M. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/fscs.1990.89553 · Cited by 197 · see citing works
Conductance and convergence of Markov chains-a combinatorial treatment of expanders
Mihail, M. (1989) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1989.63529 · Cited by 183 · see citing works
Bookmark-Coloring Algorithm for Personalized PageRank Computing
Berkhin, P. (2006) · Internet Mathematics · doi:10.1080/15427951.2006.10129116 · Cited by 152 · see citing works
Scaling personalized web search
Jeh, G., & Widom, J. (2003) · International World Wide Web Conference (WWW) · doi:10.1145/775189.775191 · Cited by 134 · see citing works
Towards Scaling Fully Personalized PageRank
Fogaras, D., & Rácz, B. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30216-2_9 · Cited by 84 · see citing works
Graph partitioning using single commodity flows
Khandekar, R., Rao, S. B., & Vazirani, U. V. (2006) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1132516.1132574 · Cited by 74 · see citing works
Exploring the community structure of newsgroups
Borgs, C., Chayes, J., Mahdian, M., & Saberi, A. (2004) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1014052.1016914 · Cited by 43 · see citing works
Flagged first, then by citations
1 of the 23 references couldn’t be matched to a known paper.
Cited by
Sorted by citations
DeepWalk: online learning of social representations
Perozzi, B., Al-Rfou, R., & Skiena, S. (2014) · Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2623330.2623732 · Cited by 10,123 · see citing works
Leskovec, J., Lang, K. J., Dasgupta, A., & Mahoney, M. W. (2009) · Internet Mathematics · doi:10.1080/15427951.2009.10129177 · Cited by 1,867 · see citing works
Self-citationSchaeffer, S. E. (2007) · Computer Science Review · doi:10.1016/j.cosrev.2007.05.001 · Cited by 1,679 · see citing works
Defining and evaluating network communities based on ground-truth
Yang, J., & Leskovec, J. (2013) · Knowledge and Information Systems · doi:10.1007/s10115-013-0693-z · Cited by 1,531 · see citing works
Graph based anomaly detection and description: a survey
Akoglu, L., Tong, H., & Koutra, D. (2015) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-014-0365-y · Cited by 1,504 · see citing works
Empirical comparison of algorithms for network community detection
Leskovec, J., Lang, K. J., & Mahoney, M. W. (2010) · International World Wide Web Conference (WWW) · doi:10.1145/1772690.1772755 · Cited by 965 · see citing works
Self-citationMaximizing Social Influence in Nearly Optimal Time
Borgs, C., Brautbar, M., Chayes, J., & Lucier, B. (2013) · ACM-SIAM Symposium on Discrete Algorithms (SODA) · doi:10.1137/1.9781611973402.70 · Cited by 864 · see citing works
Statistical properties of community structure in large social and information networks
Leskovec, J., Lang, K. J., Dasgupta, A., & Mahoney, M. W. (2008) · International World Wide Web Conference (WWW) · doi:10.1145/1367497.1367591 · Cited by 862 · see citing works
Self-citationDefining and evaluating network communities based on ground-truth
Yang, J., & Leskovec, J. (2012) · doi:10.1145/2350190.2350193 · Cited by 792 · see citing works
Random walks and diffusion on networks
Masuda, N., Porter, M. A., & Lambiotte, R. (2017) · Physics Reports · doi:10.1016/j.physrep.2017.07.007 · Cited by 661 · see citing works
Gleich, D. F. (2015) · SIAM Review · doi:10.1137/140976649 · Cited by 656 · see citing works
Local Higher-Order Graph Clustering
Yin, H., Benson, A. R., Leskovec, J., & Gleich, D. F. (2017) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3097983.3098069 · Cited by 620 · see citing works
Community detection in Social Media
Papadopoulos, S., Kompatsiaris, I. Y., Vakali, A. I., & Spyridonos, P. (2011) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-011-0224-z · Cited by 615 · see citing works
The community-search problem and how to plan a successful cocktail party
Sozio, M., & Gionis, A. (2010) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1835804.1835923 · Cited by 496 · see citing works
Streaming graph partitioning for large distributed graphs
Stanton, I., & Kliot, G. (2012) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2339530.2339722 · Cited by 449 · see citing works
Dual Graph Convolutional Networks for Graph-Based Semi-Supervised Classification
Zhuang, C., & Ma, Q. (2018) · Proceedings of the 2018 World Wide Web Conference on World Wide Web - WWW '18 · doi:10.1145/3178876.3186116 · Cited by 423 · see citing works
Spectral Sparsification of Graphs
Spielman, D. A., & Teng, S. (2011) · SIAM Journal on Computing · doi:10.1137/08074489x · Cited by 412 · see citing works
Sybil Attacks and Their Defenses in the Internet of Things
Zhang, K., Liang, X., Lu, R., & Shen, X. (2014) · IEEE Internet of Things Journal · doi:10.1109/jiot.2014.2344013 · Cited by 403 · see citing works
PullNet: Open Domain Question Answering with Iterative Retrieval on Knowledge Bases and Text
Sun, H., Bedrax-Weiss, T., & Cohen, W. W. (2019) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/d19-1242 · Cited by 397 · see citing works
IsoRankN: spectral methods for global alignment of multiple protein networks
Liao, C.-S., Lu, K.-H., Baym, M., Singh, R., & Berger, B. (2009) · Bioinformatics · doi:10.1093/bioinformatics/btp203 · Cited by 387 · see citing works
Scaling Graph Neural Networks with Approximate PageRank
Bojchevski, A., Gasteiger, J., Perozzi, B., Kapoor, A., Blais, M., Rózemberczki, B., Łukasik, M., & Günnemann, S. (2020) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3394486.3403296 · Cited by 383 · see citing works
Metrics for Community Analysis
Chakraborty, T., Dalmia, A., Mukherjee, A., & Ganguly, N. (2017) · ACM Computing Surveys · doi:10.1145/3091106 · Cited by 330 · see citing works
Spielman, D. A., & Teng, S. (2013) · SIAM Journal on Computing · doi:10.1137/080744888 · Cited by 316 · see citing works
Defining and Evaluating Network Communities Based on Ground-Truth
Yang, J., & Leskovec, J. (2012) · Proceedings · doi:10.1109/icdm.2012.138 · Cited by 260 · see citing works
Overlapping Community Detection Using Neighborhood-Inflated Seed Expansion
Whang, J. J., Gleich, D. F., & Dhillon, I. S. (2016) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2016.2518687 · Cited by 250 · see citing works
A scalable pattern mining approach to web graph compression with communities
Buehrer, G., & Chellapilla, K. (2008) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/1341531.1341547 · Cited by 249 · see citing works
The heat kernel as the pagerank of a graph
Chung, F. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0708838104 · Cited by 248 · see citing works
Self-citationData Augmentation for Deep Graph Learning
Ding, K., Xu, Z., Tong, H., & Liu, H. (2022) · ACM SIGKDD Explorations Newsletter · doi:10.1145/3575637.3575646 · Cited by 244 · see citing works
Zhang, S., & Tong, H. (2016) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2939672.2939766 · Cited by 242 · see citing works
Focused clustering and outlier detection in large attributed graphs
Perozzi, B., Akoglu, L., Sánchez, P. I., & Müller, E. (2014) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2623330.2623682 · Cited by 229 · see citing works
Improving Multi-hop Knowledge Base Question Answering by Learning Intermediate Supervision Signals
He, G., Lan, Y., Jiang, J., Zhao, W. X., & Wen, J.-R. (2021) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/3437963.3441753 · Cited by 228 · see citing works
Heat kernel based community detection
Kloster, K., & Gleich, D. F. (2014) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2623330.2623706 · Cited by 215 · see citing works
Structural Information and Dynamical Complexity of Networks
Li, A., & Pan, Y. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2555904 · Cited by 200 · see citing works
Antonellis, I., García-Molina, H., & Chang, C. C. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1453856.1453903 · Cited by 197 · see citing works
Approaching Optimality for Solving SDD Linear Systems
Koutis, I., Miller, G. L., & Peng, R. (2010) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2010.29 · Cited by 195 · see citing works
Overlapping community detection using seed set expansion
Whang, J. J., Gleich, D. F., & Dhillon, I. S. (2013) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/2505515.2505535 · Cited by 185 · see citing works
Vertex neighborhoods, low conductance cuts, and good seeds for local community methods
Gleich, D. F., & Seshadhri, C. (2012) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2339530.2339628 · Cited by 184 · see citing works
NETAL: a new graph-based method for global alignment of protein–protein interaction networks
Neyshabur, B., Khadem, A., Hashemifar, S. S., & Arab, S. S. (2013) · Bioinformatics · doi:10.1093/bioinformatics/btt202 · Cited by 178 · see citing works
SoK: The Evolution of Sybil Defense via Social Networks
Alvisi, L., Clement, A., Epasto, A., Lattanzi, S., & Panconesi, A. (2013) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2013.33 · Cited by 174 · see citing works
The many facets of community detection in complex networks
Schaub, M. T., Delvenne, J.-C., Rosvall, M., & Lambiotte, R. (2017) · Applied Network Science · doi:10.1007/s41109-017-0023-6 · Cited by 171 · see citing works
Accuracy estimate and optimization techniques for SimRank computation
Lizorkin, D., Velikhov, P., Grinev, M., & Турдаков, Д. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1453856.1453904 · Cited by 170 · see citing works
Robust local community detection
Wu, Y., Jin, R., Li, J., & Zhang, X. (2015) · Proceedings of the VLDB Endowment · doi:10.14778/2752939.2752948 · Cited by 169 · see citing works
Unsupervised Domain Adaptive Graph Convolutional Networks
Wu, M., Pan, S., Zhou, C. D., Chang, X., & Xingquan Zhu, A. (2020) · International World Wide Web Conference (WWW) · doi:10.1145/3366423.3380219 · Cited by 169 · see citing works
Spectral sparsification of graphs
Batson, J., Spielman, D. A., Srivastava, N., & Teng, S. (2013) · Communications of the ACM · doi:10.1145/2492007.2492029 · Cited by 154 · see citing works
Peng, W., Wang, J., Wang, W., Liu, Q., Wu, F., & Pan, Y. F. (2012) · BMC Systems Biology · doi:10.1186/1752-0509-6-87 · Cited by 151 · see citing works
Community membership identification from small seed sets
Kloumann, I. M., & Kleinberg, J. M. (2014) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2623330.2623621 · Cited by 143 · see citing works
Discriminative Deep Random Walk for Network Classification
Li, J., Zhu, J., & Zhang, B. (2016) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.18653/v1/p16-1095 · Cited by 142 · see citing works
Algorithms, Graph Theory, and Linear Equations in Laplacian Matrices
Spielman, D. A. (2011) · International Congress of Mathematicians (ICM) · doi:10.1142/9789814324359_0164 · Cited by 137 · see citing works
GraphMAE2: A Decoding-Enhanced Masked Self-Supervised Graph Learner
Hou, Z., He, Y., Cen, Y., Liu, X., Dong, Y., Kharlamov, E., & Tang, J. (2023) · International World Wide Web Conference (WWW) · doi:10.1145/3543507.3583379 · Cited by 137 · see citing works
Finding sparse cuts locally using evolving sets
Andersen, R., & Peres, Y. (2009) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1536414.1536449 · Cited by 131 · see citing works
Self-citationComplex Knowledge Base Question Answering: A Survey
Lan, Y., He, G., Jiang, J., Jiang, J., Zhao, W. X., & Wen, J.-R. (2022) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2022.3223858 · Cited by 131 · see citing works
Approaching Optimality for Solving SDD Linear Systems
Koutis, I., Miller, G. L., & Peng, R. (2014) · SIAM Journal on Computing · doi:10.1137/110845914 · Cited by 127 · see citing works
Learning with Partially Absorbing Random Walks
Wu, X.-M., Li, Z., So, A. M., Wright, J. N., & Chang, S. (2012) · Cited by 126 · see citing works
Learning from Collective Intelligence
Zhang, H., Shang, X., Luan, H., Wang, M., & Chua, T. (2016) · ACM Transactions on Multimedia Computing Communications and Applications · doi:10.1145/2978656 · Cited by 114 · see citing works
Fast Distributed PageRank Computation
Sarma, A. D., Molla, A. R., Pandurangan, G., & Upfal, E. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-35668-1_2 · Cited by 114 · see citing works
Local Computation of PageRank Contributions
Andersen, R., Borgs, C., Chayes, J., Hopcraft, J., Mirrokni, V., & Teng, S. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-77004-6_12 · Cited by 112 · see citing works
Self-citationWang, S., Yang, R., Xiao, X., Wei, Z., & Yang, Y. (2017) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3097983.3098072 · Cited by 110 · see citing works
Empirical Comparison of Algorithms for Network Community DetectionPreprint
Leskovec, J., Lang, K. J., & Mahoney, M. W. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1004.3539 · Cited by 110 · see citing works
Self-citationOrecchia, L., Sachdeva, S., & Vishnoi, N. K. (2012) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/2213977.2214080 · Cited by 109 · see citing works
Uncovering the Small Community Structure in Large Networks
Li, Y., He, K., Bindel, D., & Hopcroft, J. E. (2015) · International World Wide Web Conference (WWW) · doi:10.1145/2736277.2741676 · Cited by 104 · see citing works
Multiscale mixing patterns in networks
Peel, L., Delvenne, J., & Lambiotte, R. (2018) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1713019115 · Cited by 104 · see citing works
Ma, Y., & Tang, J. (2021) · Cambridge University Press eBooks · doi:10.1017/9781108924184 · Cited by 103 · see citing works
Lofgren, P., Banerjee, S., Goel, A., & Seshadhri, C. (2014) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2623330.2623745 · Cited by 101 · see citing works
Effective and Efficient Community Search Over Large Directed Graphs
Fang, Y., Wang, Z., Cheng, R. C. K., Wang, H., & Hu, J. (2018) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2872982 · Cited by 100 · see citing works
Accuracy estimate and optimization techniques for SimRank computation
Lizorkin, D., Velikhov, P., Grinev, M., & Турдаков, Д. (2009) · The VLDB Journal · doi:10.1007/s00778-009-0168-8 · Cited by 99 · see citing works
Local Spectral Clustering for Overlapping Community Detection
Li, Y., He, K., Kloster, K., Bindel, D., & Hopcroft, J. E. (2018) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/3106370 · Cited by 94 · see citing works
Grover search with lackadaisical quantum walks
Wong, T. G. (2015) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/48/43/435304 · Cited by 93 · see citing works
On Proximity and Structural Role-based Embeddings in Networks
Rossi, R. A., Jin, D., Kim, S., Ahmed, N. K., Koutra, D., & Lee, J. B. (2020) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/3397191 · Cited by 92 · see citing works
Fast Local Computation AlgorithmsPreprint
Rubinfeld, R., Tamir, G., Vardi, S., & Xie, N. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1104.1377 · Cited by 92 · see citing works
Large-Scale Community Detection on YouTube for Topic Discovery and Exploration
Gargi, U., Lu, W., Mirrokni, V., & Yoon, S. (2021) · Proceedings of the International AAAI Conference on Web and Social Media · doi:10.1609/icwsm.v5i1.14191 · Cited by 91 · see citing works
Maji, S., Vishnoi, N. K., & Malik, J. (2011) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2011.5995630 · Cited by 90 · see citing works
Community Discovery in Social Networks: Applications, Methods and Emerging Trends
Parthasarathy, S., Ruan, Y., & Satuluri, V. (2011) · Springer eBooks · doi:10.1007/978-1-4419-8462-3_4 · Cited by 90 · see citing works
Global Alignment of Protein-Protein Interaction Networks: A Survey
Elmsallati, A., Clark, C., & Kalita, J. K. (2015) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2015.2474391 · Cited by 89 · see citing works
PRINCE: Provider-side Interpretability with Counterfactual Explanations in Recommender Systems
Ghazimatin, A., Balalau, O., Saha Roy, R., & Weikum, G. (2020) · Proceedings of the 13th International Conference on Web Search and Data Mining · doi:10.1145/3336191.3371824 · Cited by 88 · see citing works
Mahoney, M. W., Orecchia, L., & Vishnoi, N. K. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0912.0681 · Cited by 87 · see citing works
The post-genomic era of biological network alignment
Faisal, F. E., Meng, L., Crawford, J., & Milenković, T. (2015) · EURASIP Journal on Bioinformatics and Systems Biology · doi:10.1186/s13637-015-0022-9 · Cited by 85 · see citing works
Representation Learning for Natural Language Processing
Liu, Z., Lin, Y., & Sun, M. (2020) · Springer eBooks · doi:10.1007/978-981-15-5573-2 · Cited by 84 · see citing works
Text Classification with Heterogeneous Information Network Kernels
Wang, C., Song, Y., Li, H., Zhang, M., & Han, J. (2016) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v30i1.10297 · Cited by 82 · see citing works
Parallel local graph clustering
Shun, J., Roosta, F., Fountoulakis, K., & Mahoney, M. W. (2016) · Proceedings of the VLDB Endowment · doi:10.14778/2994509.2994522 · Cited by 81 · see citing works
Zhang, Y., Xiong, Y., Ye, Y., Liu, T., Wang, W., Zhu, Y., & Yu, P. S. (2020) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3394486.3403154 · Cited by 81 · see citing works
Detecting Overlapping Communities from Local Spectral Subspaces
He, K., Sun, Y., Bindel, D., Hopcroft, J. E., & Li, Y. (2015) · Proceedings · doi:10.1109/icdm.2015.89 · Cited by 79 · see citing works
Local Computation of PageRank Contributions
Andersen, R., Borgs, C., Chayes, J., Hopcroft, J. E., Mirrokni, V., & Teng, S. (2008) · Internet Mathematics · doi:10.1080/15427951.2008.10129302 · Cited by 79 · see citing works
Self-citationApproximate Personalized PageRank on Dynamic Graphs
Zhang, H. R., Lofgren, P., & Goel, A. (2016) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2939672.2939804 · Cited by 79 · see citing works
Wei, Z., He, X., Xiao, X., Wang, S., Shang, S., & Wen, J.-R. (2018) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/3183713.3196920 · Cited by 79 · see citing works
Using PageRank to Locally Partition a Graph
Andersen, R., Chung, F., & Lang, K. (2007) · Internet Mathematics · doi:10.1080/15427951.2007.10129139 · Cited by 77 · see citing works
Self-citationTRacer: Scalable Graph-Based Transaction Tracing for Account-Based Blockchain Trading Systems
Wu, Z., Liu, J., Wu, J., Zheng, Z., & Chen, T. (2023) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2023.3266162 · Cited by 76 · see citing works
Estimating PageRank on graph streams
Sarma, A. D., Gollapudi, S., & Panigrahy, R. (2008) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/1376916.1376928 · Cited by 76 · see citing works
Estimating PageRank on graph streams
Sarma, A. D., Gollapudi, S., & Panigrahy, R. (2011) · Journal of the ACM · doi:10.1145/1970392.1970397 · Cited by 76 · see citing works
A Brief Survey of PageRank Algorithms
Chung, F. (2014) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2014.2380315 · Cited by 76 · see citing works
Self-citationFast Approximation Algorithms for Cut-Based Problems in Undirected Graphs
Mądry, A. (2010) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2010.30 · Cited by 76 · see citing works
Detecting Community Kernels in Large Social Networks
Wang, L., Lou, T., Tang, J., & Hopcroft, J. E. (2011) · Proceedings · doi:10.1109/icdm.2011.48 · Cited by 74 · see citing works
Chen, J., & Safro, I. (2011) · SIAM Journal on Scientific Computing · doi:10.1137/090775087 · Cited by 74 · see citing works
Scalable Graph Neural Networks via Bidirectional PropagationPreprint
Chen, M., Wei, Z., Ding, B., Li, Y., Yuan, Y., Du, X., & Wen, J.-R. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2010.15421 · Cited by 74 · see citing works
Shin, K., Jung, J., Sael, L., & Kang, U. (2015) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/2723372.2723716 · Cited by 72 · see citing works
Multi-agent Random Walks for Local Clustering on Graphs
Alamgir, M., & Ulrike Von Luxburg, A. (2010) · Proceedings · doi:10.1109/icdm.2010.87 · Cited by 71 · see citing works
Wang, S., Tang, Y., Xiao, X., Yang, Y., & Li, Z. (2016) · Proceedings of the VLDB Endowment · doi:10.14778/3021924.3021936 · Cited by 71 · see citing works
Fishing for Fraudsters: Uncovering Ethereum Phishing Gangs With Blockchain Data
Liu, J., Chen, J., Wu, J., Wu, Z., Fang, J., & Zheng, Z. (2024) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2024.3359000 · Cited by 70 · see citing works
Finding local communities in protein networks
Voevodski, K., Teng, S., & Xia, Y. (2009) · BMC Bioinformatics · doi:10.1186/1471-2105-10-297 · Cited by 70 · see citing works
Asymptotic analysis for personalized Web search
Volkovich, Y., & Litvak, N. (2010) · Advances in Applied Probability · doi:10.1239/aap/1275055243 · Cited by 69 · see citing works
Block models and personalized PageRank
Kloumann, I. M., Ugander, J. H., & Kleinberg, J. M. (2016) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1611275114 · Cited by 69 · see citing works
- Authors
- Andersen, R., Chung, F., & Lang, K.
- Affiliations
- University of California San Diego (US)
- Yahoo (United States) (US)
- Venue
- 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)
- Publisher
- IEEE
- Published
- 2006
- Pages
- 475-486
- ISSN
- 0272-5428 (ISSN-L)
- OpenAlex
- W2086254934
- Cited by
- 967
- References
- 23
- Citations by year
- 2026: 20 · 2025: 40 · 2024: 46 · 2023: 57 · 2022: 55 · 2021: 84 · 2020: 71 · 2019: 72 · 2018: 63 · 2017: 61 · 2016: 69 · 2015: 65 · 2014: 52 · 2013: 55 · 2012: 50
- FWCI
- 13.60
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Annual Symposium on Foundations of Computer Science (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Graph Theory and Algorithms
- Keywords
- graph cuts, conductance, random walks
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review