The DOI matches its Crossref record; 122 of the 122 references it cites were found in a registry or an index.
PageRank Beyond the Web
Open accessAbstract
Google's PageRank method was developed to evaluate the importance of web-pages via their link structure. The mathematics of PageRank, however, are entirely general and apply to any graph or network in any domain. Thus, PageRank is now regularly used in bibliometrics, social and information network analysis, and for link prediction and recommendation. It's even used for systems analysis of road networks, as well as biology, chemistry, neuroscience, and physics. We'll see the mathematics and ideas that unite these diverse applications.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(2003) · Journal of Machine Learning Research · doi:10.5555/944919.944937 · Cited by 32,337
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
(1999) · Cited by 12,854
A Set of Measures of Centrality Based on Betweenness
Freeman, L. C. (1977) · Sociometry · doi:10.2307/3033543 · Cited by 10,295
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1999) · Journal of the ACM · doi:10.1145/324133.324140 · Cited by 8,959
What is Twitter, a social network or a news media?
Kwak, H., Lee, C., Park, H., & Moon, S. (2010) · Proceedings of the 19th international conference on World wide web · doi:10.1145/1772690.1772751 · Cited by 6,652
Chung, F. (1996) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/092 · Cited by 5,524
Algebraic connectivity of graphs
Fiedler, M. (1973) · Czechoslovak Mathematical Journal · doi:10.21136/cmj.1973.101168 · Cited by 3,977
A New Status Index Derived from Sociometric Analysis
Katz, L. (1953) · Psychometrika · doi:10.1007/bf02289026 · Cited by 3,866
Learning with Local and Global Consistency
Zhou, D., Bousquet, O., Lal, T. N., Weston, J., & Schölkopf, B. (2003) · MPG.PuRe (Max Planck Society) · Cited by 3,864
The university of Florida sparse matrix collection
Davis, T. A., & Hu, Y. (2011) · ACM Transactions on Mathematical Software · doi:10.1145/2049662.2049663 · Cited by 3,630
Matrix Analysis and Applied Linear Algebra
Meyer, C. (2000) · doi:10.1137/1.9780898719512 · Cited by 3,565
Matrix analysis and applied linear algebra
(2001) · Choice Reviews Online · doi:10.5860/choice.38-5065 · Cited by 3,300
The link‐prediction problem for social networks
Liben‐Nowell, D., & Kleinberg, J. (2007) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.20591 · Cited by 3,043
Bassett, D. S., & Bullmore, E. (2006) · The Neuroscientist · doi:10.1177/1073858406293182 · Cited by 2,600
The Centrality Index of a Graph
Sabidussi, G. (1966) · Psychometrika · doi:10.1007/bf02289527 · Cited by 2,476
Citation Indexes for Science: A New Dimension in Documentation through Association of Ideas
Garfield, E. (1955) · Science · doi:10.1126/science.122.3159.108 · Cited by 2,334
SimRank: a measure of structural-context similarity
Jeh, G., & Widom, J. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775126 · Cited by 1,925
Introduction to the Numerical Solution of Markov Chains
Stewart, W. J. (1995) · Princeton University Press eBooks · doi:10.1515/9780691223384 · Cited by 1,750
Co-clustering documents and words using bipartite spectral graph partitioning
Dhillon, I. S. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502550 · Cited by 1,697
Partitioning Sparse Matrices with Eigenvectors of Graphs
Pothen, A., Simon, H. D., & Liou, K.-P. (1990) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0611030 · Cited by 1,684
Schaeffer, S. E. (2007) · Computer Science Review · doi:10.1016/j.cosrev.2007.05.001 · Cited by 1,639
Haveliwala, T. H. (2002) · Proceedings of the 11th international conference on World Wide Web · doi:10.1145/511446.511513 · Cited by 1,567
Google's PageRank and Beyond: The Science of Search Engine Rankings
Langville, A. N., & Meyer, C. D. (2006) · Cited by 1,204
Fast Random Walk with Restart and Its Applications
Tong, H., Faloutsos, C., & Pan, J.-Y. (2006) · Sixth International Conference on Data Mining (ICDM'06) · doi:10.1109/icdm.2006.70 · Cited by 1,184
Friedkin, N. E., & Johnsen, E. C. (1990) · The Journal of Mathematical Sociology · doi:10.1080/0022250x.1990.9990069 · Cited by 1,176
Network Centrality in the Human Functional Connectome
Zuo, X.-N., Ehmke, R., Mennes, M., Imperati, D., Castellanos, F. X., Sporns, O., & Milham, M. P. (2012) · Cerebral Cortex · doi:10.1093/cercor/bhr269 · Cited by 1,175
Combating Web Spam with TrustRank
Gyöngyi, Z., Garcia-Molina, H., & Pedersen, J. (2004) · Proceedings 2004 VLDB Conference · doi:10.1016/b978-012088469-8.50052-8 · Cited by 1,085
Supervised random walks: predicting and recommending links in social networks
Backstrom, L., & Leskovec, J. (2011) · Proceedings of the fourth ACM international conference on Web search and data mining · doi:10.1145/1935826.1935914 · Cited by 982
Local Graph Partitioning using PageRank Vectors
Andersen, R., Chung, F., & Lang, K. (2006) · 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) · doi:10.1109/focs.2006.44 · Cited by 967
Reversible Markov Chains and Random Walks on Graphs
Aldous, D., & Fill, J. A. (2014) · Cited by 946
Langville, A., & Meyer, C. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129091 · Cited by 894
Leaders in Social Networks, the Delicious Case
Lü, L., Zhang, Y.-C., Yeung, C. H., & Zhou, T. (2011) · PLoS ONE · doi:10.1371/journal.pone.0021202 · Cited by 871
Information Retrieval in Folksonomies: Search and Ranking
Hotho, A., Jäschke, R., Schmitz, C., & Stumme, G. (2006) · Lecture Notes in Computer Science · doi:10.1007/11762256_31 · Cited by 845
Co-authorship networks in the digital library research community
Liu, X., Bollen, J., Nelson, M. L., & Van de Sompel, H. (2005) · Information Processing & Management · doi:10.1016/j.ipm.2005.03.012 · Cited by 823
Google's PageRank and Beyond: The Science of Search Engine Rankings
Langville, A. N., & Meyer, C. D. (2006) · doi:10.1515/9781400830329 · Cited by 814
Strong Regularities in World Wide Web Surfing
Huberman, B. A., Pirolli, P. L. T., Pitkow, J. E., & Lukose, R. M. (1998) · Science · doi:10.1126/science.280.5360.95 · Cited by 748
Pinski, G., & Narin, F. (1976) · Information Processing & Management · doi:10.1016/0306-4573(76)90048-0 · Cited by 597
Xing, W., & Ghorbani, A. (2004) · Proceedings. Second Annual Conference on Communication Networks and Services Research, 2004. · doi:10.1109/dnsr.2004.1344743 · Cited by 572
Bianchini, M., Gori, M., & Scarselli, F. (2005) · ACM Transactions on Internet Technology · doi:10.1145/1052934.1052938 · Cited by 539
Laplacians and the Cheeger Inequality for Directed Graphs
Chung, F. (2005) · Annals of Combinatorics · doi:10.1007/s00026-005-0237-z · Cited by 535
Finding scientific gems with Google’s PageRank algorithm
Chen, P., Xie, H., Maslov, S., & Redner, S. (2007) · Journal of Informetrics · doi:10.1016/j.joi.2006.06.001 · Cited by 483
Automatic multimedia cross-modal correlation discovery
Pan, J.-Y., Yang, H.-J., Faloutsos, C., & Duygulu, P. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014135 · Cited by 479
Eigenvalues of the Laplacian of a graph∗
Anderson, W. N., & Morley, T. D. (1985) · Linear and Multilinear Algebra · doi:10.1080/03081088508817681 · Cited by 475
A Survey on PageRank Computing
Berkhin, P. (2005) · Internet Mathematics · doi:10.1080/15427951.2005.10129098 · Cited by 474
Balmin, A., Hristidis, V., & Papakonstantinou, Y. (2004) · Proceedings 2004 VLDB Conference · doi:10.1016/b978-012088469-8.50051-6 · Cited by 452
VisualRank: Applying PageRank to Large-Scale Image Search
Jing, Y., & Baluja, S. (2008) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.121 · Cited by 441
Characterization of 3D molecular structure
Estrada, E. (2000) · Chemical Physics Letters · doi:10.1016/s0009-2614(00)00158-5 · Cited by 429
A Measure of Similarity between Graph Vertices: Applications to Synonym Extraction and Web Searching
Blondel, V. D., Gajardo, A., Heymans, M., Senellart, P., & Van Dooren, P. (2004) · SIAM Review · doi:10.1137/s0036144502415960 · Cited by 423
New factors in the evaluation of scientific literature through citation indexing
Garfield, E., & Sher, I. H. (1963) · American Documentation · doi:10.1002/asi.5090140304 · Cited by 420
Learning from labeled and unlabeled data on a directed graph
Zhou, D., Huang, J., & Schölkopf, B. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102482 · Cited by 403
Bollen, J., Rodriquez, M. A., & Van de Sompel, H. (2006) · Scientometrics · doi:10.1007/s11192-006-0176-z · Cited by 401
Fast incremental and personalized PageRank
Bahmani, B., Chowdhury, A., & Goel, A. (2010) · Proceedings of the VLDB Endowment · doi:10.14778/1929861.1929864 · Cited by 327
Network Properties Revealed through Matrix Functions
Estrada, E., & Higham, D. J. (2010) · SIAM Review · doi:10.1137/090761070 · Cited by 313
(2003) · Cited by 312
Bringing PageRank to the citation analysis
Ma, N., Guan, J., & Zhao, Y. X. (2007) · Information Processing & Management · doi:10.1016/j.ipm.2007.06.006 · Cited by 293
Pairwise Global Alignment of Protein Interaction Networks by Matching Neighborhood Topology
Singh, R., Xu, J., & Berger, B. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-71681-5_2 · Cited by 286
The Perron–Frobenius Theorem and the Ranking of Football Teams
Keener, J. P. (1993) · SIAM Review · doi:10.1137/1035004 · Cited by 274
Network analysis, complexity, and brain function
Sporns, O. (2002) · Complexity · doi:10.1002/cplx.10047 · Cited by 274
GeneRank: Using search engine technology for the analysis of microarray experiments
Morrison, J. L., Breitling, R., Higham, D. J., & Gilbert, D. R. (2005) · BMC Bioinformatics · doi:10.1186/1471-2105-6-233 · Cited by 271
Nie, Z., Zhang, Y., Wen, J.-R., & Ma, W. (2005) · International World Wide Web Conference (WWW) · doi:10.1145/1060745.1060828 · Cited by 266
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 254
Ranking scientific publications using a model of network traffic
Walker, D., Xie, H., Yan, K.-K., & Maslov, S. (2007) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2007/06/p06010 · Cited by 237
Googling Food Webs: Can an Eigenvector Measure Species' Importance for Coextinctions?
Allesina, S., & Pascual, M. (2009) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1000494 · Cited by 227
Halu, A., Mondragón, R. J., Panzarasa, P., & Bianconi, G. (2013) · PLoS ONE · doi:10.1371/journal.pone.0078293 · Cited by 212
Winter, C., Kristiansen, G., Kersting, S., Roy, J., Aust, D., Knösel, T., Rümmele, P., Jahnke, B., Hentrich, V., Rückert, F., et al. (2012) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1002511 · Cited by 210
Eiron, N., McCurley, K. S., & Tomlin, J. A. (2004) · Proceedings of the 13th international conference on World Wide Web · doi:10.1145/988672.988714 · Cited by 209
PageRank Computation and the Structure of the Web: Experiments and Algorithms
Arasu, A., Novak, J., Tomkins, A., & Tomlin, J. A. (2002) · Cited by 202
PageRank as a function of the damping factor
Boldi, P., Santini, M., & Vigna, S. (2005) · Proceedings of the 14th international conference on World Wide Web - WWW '05 · doi:10.1145/1060745.1060827 · Cited by 195
Self-organized natural roads for predicting traffic flow: a sensitivity study
Jiang, B., Zhao, S., & Yin, J. (2008) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/2008/07/p07008 · Cited by 190
Learning spectral graph transformations for link prediction
Kunegis, J., & Lommatzsch, A. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553447 · Cited by 181
The Eigenfactor MetricsTM: A Network Approach to Assessing Scholarly Journals
West, J. D., Bergstrom, T. C., & Bergstrom, C. T. (2010) · College & Research Libraries · doi:10.5860/0710236 · Cited by 179
BrowseRank: letting web users vote for page importance
Liu, Y., Gao, B., Liu, T.-Y., Zhang, Y., Ma, Z., He, S., & Li, H. (2008) · Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1390334.1390412 · Cited by 172
Who Is the Best Player Ever? A Complex Network Analysis of the History of Professional Tennis
Radicchi, F. (2011) · PLoS ONE · doi:10.1371/journal.pone.0017249 · Cited by 160
Ranking spaces for predicting human movement in an urban environment
Jiang, B. (2008) · International Journal of Geographical Information Systems · doi:10.1080/13658810802022822 · Cited by 147
Ranking hubs and authorities using matrix functions
Michele Benzi, A., Estrada, E., & Klymko, C. (2012) · Linear Algebra and its Applications · doi:10.1016/j.laa.2012.10.022 · Cited by 134
Sylvester, J. J. (1878) · Nature · doi:10.1038/017284a0 · Cited by 128
Link analysis for Web spam detection
Becchetti, L., Castillo, C., Donato, D., Baeza-Yates, R. A., & Leonardi, S. (2008) · ACM Transactions on the Web · doi:10.1145/1326561.1326563 · Cited by 121
Farahat, A., LoFaro, T., Miller, J. C., Rae, G., & Ward, L. A. (2006) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827502412875 · Cited by 117
Fast PageRank Computation via a Sparse Linear System
Corso, G. M. D., Gullì, A., & Romani, F. (2005) · Internet Mathematics · doi:10.1080/15427951.2005.10129108 · Cited by 114
Improving Random Walk Estimation Accuracy with Uniform Restarts
Avrachenkov, K. E., Ribeiro, B., & Towsley, D. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-18009-5_10 · Cited by 109
An Arnoldi-type algorithm for computing page rank
Golub, G. H., & Greif, C. (2006) · BIT Numerical Mathematics · doi:10.1007/s10543-006-0091-y · Cited by 109
Boldi, P., Santini, M., & Vigna, S. (2009) · ACM Transactions on Information Systems · doi:10.1145/1629096.1629097 · Cited by 104
Message-Passing Algorithms for Sparse Network Alignment
Bayati, M., Gleich, D. F., Saberi, A., & Wang, Y. (2013) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/2435209.2435212 · Cited by 104
Self-citationBaeza-Yates, R. A., Boldi, P., & Castillo, C. (2006) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/1148170.1148225 · Cited by 101
A new paradigm for ranking pages on the world wide web
Tomlin, J. A. (2003) · International World Wide Web Conference (WWW) · doi:10.1145/775152.775202 · Cited by 88
Mahoney, M. W., Orecchia, L., & Vishnoi, N. K. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0912.0681 · Cited by 87
Root cause detection in a service-oriented architecture
Kim, M., Sumbaly, R., & Shah, S. (2013) · ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) · doi:10.1145/2465529.2465753 · Cited by 83
Two-dimensional ranking of Wikipedia articles
Zhirov, A., Zhirov, O. V., & Shepelyansky, D. L. (2010) · The European Physical Journal B · doi:10.1140/epjb/e2010-10500-7 · Cited by 82
An Inner-Outer Iteration for Computing PageRank
Gleich, D. F., Gray, A. P., Greif, C., & Lau, T. (2010) · SIAM Journal on Scientific Computing · doi:10.1137/080727397 · Cited by 82
Self-citationA dynamical systems view of network centrality
Grindrod, P., & Higham, D. J. (2014) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.2013.0835 · Cited by 80
Random Walker Ranking for NCAA Division I-A Football
Callaghan, T., Mucha, P. J., & Porter, M. A. (2007) · American Mathematical Monthly · doi:10.1080/00029890.2007.11920469 · Cited by 79
Jordan Canonical Form of the Google Matrix: A Potential Contribution to the PageRank Computation
Serra‐Capizzano, S. (2005) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479804441407 · Cited by 76
PageRank for bibliographic networks
Fiala, D., Rousselot, F., & Ježek, K. (2008) · Scientometrics · doi:10.1007/s11192-007-1908-4 · Cited by 74
Najork, M., Zaragoza, H., & Taylor, M. J. H. (2007) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/1277741.1277823 · Cited by 73
Interactions of Cultures and Top People of Wikipedia from Ranking of 24 Language Editions
Eom, Y.-H., Aragón, P., Laniado, D., Kaltenbrunner, A., Vigna, S., & Shepelyansky, D. L. (2015) · PLoS ONE · doi:10.1371/journal.pone.0114825 · Cited by 71
Towards physical laws for software architecturePreprint
Chepelianskii, A. D. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1003.5455 · Cited by 70
Query suggestion by constructing term-transition graphs
Song, Y., Zhou, D., & He, L.-W. (2012) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/2124295.2124339 · Cited by 64
Viscous democracy for social networks
Boldi, P., Bonchi, F., Castillo, C., & Vigna, S. (2011) · Communications of the ACM · doi:10.1145/1953122.1953154 · Cited by 55
A Dynamical System for PageRank with Time-Dependent Teleportation
Gleich, D. F., & Rossi, R. A. (2014) · Internet Mathematics · doi:10.1080/15427951.2013.814092 · Cited by 48
Self-citationSpectral affinity in protein networks
Voevodski, K., Teng, S., & Xia, Y. (2009) · BMC Systems Biology · doi:10.1186/1752-0509-3-112 · Cited by 47
Constantine, P. G., & Gleich, D. F. (2009) · Internet Mathematics · doi:10.1080/15427951.2009.10129185 · Cited by 40
Self-citationLocal approximation of PageRank and reverse PageRank
Bar-Yossef, Z., & Mashiach, L.-T. (2008) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/1390334.1390545 · Cited by 39
Traffic modelling framework for electric vehicles
Schlote, A., Crisostomi, E., Kirkland, S. J., & Shorten, R. N. (2012) · International Journal of Control · doi:10.1080/00207179.2012.668716 · Cited by 33
TotalRank: ranking without damping
Boldi, P. (2005) · International World Wide Web Conference (WWW) · doi:10.1145/1062745.1062787 · Cited by 32
Crofts, J. J., & Higham, D. J. (2011) · Internet Mathematics · doi:10.1080/15427951.2011.604284 · Cited by 32
Communicability and multipartite structures in complex networks at negative absolute temperatures
Estrada, E., Higham, D. J., & Hatano, N. (2008) · Physical Review E · doi:10.1103/physreve.78.026102 · Cited by 32
A General Setting for the Parametric Google Matrix
Horn, R. A., & Serra‐Capizzano, S. (2006) · Internet Mathematics · doi:10.1080/15427951.2006.10129131 · Cited by 30
Ordinal Ranking for Google's PageRank
Wills, R. S., & Ipsen, I. C. F. (2009) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/070698129 · Cited by 29
Approximating Personalized PageRank with Minimal Use of Web Graph Data
Gleich, D. F., & Polito, M. (2006) · Internet Mathematics · doi:10.1080/15427951.2006.10129128 · Cited by 26
Self-citationGoogle matrix, dynamical attractors, and Ulam networks
Shepelyansky, D. L., & Zhirov, O. V. (2010) · Physical Review E · doi:10.1103/physreve.81.036213 · Cited by 25
Traps and Pitfalls of Topic-Biased PageRank
Boldi, P., Posenato, R., Santini, M., & Vigna, S. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-78808-9_10 · Cited by 23
Gene Prioritization for Type 2 Diabetes in Tissue-specific Protein Interaction Networks ∗
Jiang, B., Wang, J., Xiao, J., et al. (2009) · Rare & Special e-Zone (The Hong Kong University of Science and Technology) · Cited by 20
A Two-Stage Algorithm for Computing PageRank and Multistage Generalizations
Lee, C. P., Golub, G. H., & Zenios, S. A. (2007) · Internet Mathematics · doi:10.1080/15427951.2007.10129151 · Cited by 20
Google PageRank as mean playing time for pinball on the reverse web
Higham, D. J. (2005) · Applied Mathematics Letters · doi:10.1016/j.aml.2005.02.020 · Cited by 14
Generalized BadRank with Graduated Trust
Report, S., Kolda, T. G., & Procopio, M. J. (2009) · Cited by 14
A combined approach for evaluating papers, authors and scientific journals
Bini, D. A., Corso, G. M. D., & Romani, F. (2010) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2010.02.003 · Cited by 13
Frahm, K. M., Chepelianskii, A. D., & Shepelyansky, D. L. (2012) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/45/40/405101 · Cited by 12
Surfing the Network for Ranking by Multidamping
Kollias, G., Gallopoulos, E., & Grama, A. Y. (2013) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2013.15 · Cited by 11
Fast PageRank Computation Via a Sparse Linear System (Extended Abstract)
Corso, G. M. D., Gullì, A., & Romani, F. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30216-2_10 · Cited by 8
Three results on the PageRank vector: eigenstructure, sensitivity, and the derivative
Gleich, D. F., Glynn, P. W., Golub, G. H., & Greif, C. (2007) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/dagsemproc.07071.17 · Cited by 7
Self-citationGraph and matrix metrics to analyze ergodic literature for children
Kontopoulou, E.-M., Predari, M., Kostakis, T., & Gallopoulos, E. (2012) · ACM Conference on Hypertext and Social Media (HT) · doi:10.1145/2309996.2310018 · Cited by 4
Cited by
Vital nodes identification in complex networks
Lü, L., Chen, D., Ren, X.-L., Zhang, Q.-M., Zhang, Y.-C., & Zhou, T. (2016) · Physics Reports · doi:10.1016/j.physrep.2016.06.007 · Cited by 1,183
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 657
The physics of spreading processes in multilayer networks
De Domenico, M., Granell, C., Porter, M. A., & Arenas, A. (2016) · Nature Physics · doi:10.1038/nphys3865 · Cited by 649
What are higher-order networks?
Bick, C., Gross, E., Harrington, H. A., & Schaub, M. T. (2023) · SIAM Review · doi:10.1137/21m1414024 · Cited by 420
The science of science: From the perspective of complex systems
Zeng, A., Shen, Z., Zhou, J., Wu, J., Fan, Y., Wang, Y., & Stanley, H. E. (2017) · Physics Reports · doi:10.1016/j.physrep.2017.10.001 · Cited by 410
Metadata
- Authors
- Gleich, D. F.
- Venue
- SIAM Review
- Published
- 2015-01
- Volume
- 57
- Issue
- 3
- Pages
- 321-363
- ISSN
- 0036-1445 (ISSN-L)
- 1095-7200
- OpenAlex
- W1865958364
- Cited by
- 646
- References
- 122
- FWCI
- 32.07
- Type
- journal article
- Language
- en
- Open access
- green
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
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.