Using PageRank to Characterize Web Structure
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the Web, the power-law exponents are believed to satisfy α = 1.1 for the in-degree and PageRank, and α ≈ 2 for the out-degree.
“In the Web, the power law exponents can deviate depending on a data set and an estimator, but are believed to satisfy α = 1 . 1 for the in-degree and PageRank, and α ≈ 2 for the out-degree [9], [32], [38].”
From Asymptotic analysis for personalized Web search (2010) · cites this paper as [32]
Most experimental studies of the Web agree that the in-degree, the out-degree, and the PageRank of the Web follow power laws.
“Most experimental studies of the Web agree that the in-degree, the out-degree, and the PageRank of the Web follow power laws.”
From Asymptotic analysis for personalized Web search (2010) · cites this paper as [32]
Cites
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135 · see citing works
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
Bollobás, B. (1985) · Cited by 6,196 · see citing works
Motwani, R., & Raghavan, P. (1995) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814075 · Cited by 5,098 · see citing works
Self-citationBroder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., & Wiener, J. (2000) · Computer Networks · doi:10.1016/s1389-1286(00)00083-9 · Cited by 2,810 · see citing works
Self-citationMean-field theory for scale-free random networks
Barabási, A.-Ĺ., Albert, R., & Jeong, H. (1999) · Physica A Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(99)00291-5 · Cited by 2,271 · see citing works
Scale-free characteristics of random networks: the topology of the world-wide web
Barabási, A.-Ĺ., Albert, R., & Jeong, H. (2000) · Physica A Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(00)00018-2 · Cited by 1,426 · see citing works
The Web as a Graph: Measurements, Models, and Methods
Kleinberg, J. M., Kumar, R., Raghavan, P., Rajagopalan, S., & Tomkins, A. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48686-0_1 · Cited by 1,027 · see citing works
Self-citationPower-Law Distribution of the World Wide Web
Adamic, L. A., & Huberman, B. A. (2000) · Science · doi:10.1126/science.287.5461.2115a · Cited by 1,022 · see citing works
Trawling the Web for emerging cyber-communities
Kumar, R., Raghavan, P., Rajagopalan, S., & Tomkins, A. (1999) · Computer Networks · doi:10.1016/s1389-1286(99)00040-7 · Cited by 999 · see citing works
Self-citationA random graph model for massive graphs
Aiello, W. A., Chung, F., & Lü, L. (2000) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/335305.335326 · Cited by 935 · see citing works
Langville, A. N., & Meyer, C. D. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129091 · Cited by 885 · see citing works
The degree sequence of a scale‐free random graph process
Bollobás, B., Riordan, O. M., Spencer, J., & Tusnády, G. (2001) · Random Structures and Algorithms · doi:10.1002/rsa.1009 · Cited by 811 · see citing works
Inferring Web communities from link topology
Gibson, D., Kleinberg, J. M., & Raghavan, P. (1998) · doi:10.1145/276627.276652 · Cited by 775 · see citing works
Self-citationStochastic models for the Web graph
Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tomkins, A., & Upfal, E. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892065 · Cited by 682 · see citing works
Self-citationArasu, A., Cho, J. J., García-Molina, H., Paepcke, A., & Raghavan, S. (2001) · ACM Transactions on Internet Technology · doi:10.1145/383034.383035 · Cited by 504 · see citing works
Cooper, C., & FRIEZE, A. M. (2003) · Random Structures and Algorithms · doi:10.1002/rsa.10084 · Cited by 345 · see citing works
Dill, S., Kumar, R., Mccurley, K. S., Rajagopalan, S., Sivakumar, D., & Tomkins, A. (2002) · ACM Transactions on Internet Technology · doi:10.1145/572326.572328 · Cited by 197 · see citing works
Algorithmic Challenges in Web Search Engines
Henzinger, M. R. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129079 · Cited by 81 · see citing works
A stochastic model for the evolution of the Web
Mark Levene, A., Fenner, T. I., Loizou, G. D., & Wheeldon, R. (2002) · Computer Networks · doi:10.1016/s1389-1286(02)00209-8 · Cited by 61 · see citing works
Variations on Random Graph Models for the Web
Drinea, E., Enachescu, M., & Mitzenmacher, M. (2001) · Digital Access to Scholarship at Harvard (DASH) (Harvard University) · Cited by 56 · 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
Langville, A. N., & Meyer, C. D. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129091 · Cited by 885 · see citing works
PEGASUS: A Peta-Scale Graph Mining System Implementation and Observations
Kang, U., Tsourakakis, C. E., & Faloutsos, C. (2009) · Proceedings · doi:10.1109/icdm.2009.14 · Cited by 618 · see citing works
Chakrabarti, D., & Faloutsos, C. (2006) · ACM Computing Surveys · doi:10.1145/1132952.1132954 · Cited by 606 · see citing works
A Survey on PageRank Computing
Berkhin, P. (2005) · Internet Mathematics · doi:10.1080/15427951.2005.10129098 · Cited by 470 · see citing works
A Survey of Eigenvector Methods for Web Information Retrieval
Langville, A. N., & Meyer, C. D. (2005) · SIAM Review · doi:10.1137/s0036144503424786 · Cited by 422 · see citing works
Спирин, Н. А., & Han, J. (2012) · ACM SIGKDD Explorations Newsletter · doi:10.1145/2207243.2207252 · Cited by 250 · see citing works
Automatic performance tuning of sparse matrix kernels
Vuduc, R. W., & Demmel, J. W. (2003) · Cited by 226 · see citing works
Eiron, N., McCurley, K. S., & Tomlin, J. A. (2004) · International World Wide Web Conference (WWW) · doi:10.1145/988672.988714 · Cited by 216 · see citing works
"Googlearchy": How a Few Heavily-Linked Sites Dominate Politics on the Web
Hindman, M., Tsioutsiouliklis, K., & Johnson, J. A. (2003) · Cited by 168 · see citing works
Relevance weighting for query independent evidence
Craswell, N., Robertson, S. E., Zaragoza, H., & Taylor, M. J. H. (2005) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/1076034.1076106 · Cited by 161 · see citing works
PEGASUS: mining peta-scale graphs
Kang, U., Tsourakakis, C. E., & Faloutsos, C. (2010) · Knowledge and Information Systems · doi:10.1007/s10115-010-0305-0 · Cited by 159 · see citing works
Bar-Yossef, Z., Broder, A., Kumar, R., & Tomkins, A. (2004) · International World Wide Web Conference (WWW) · doi:10.1145/988672.988716 · Cited by 157 · see citing works
Topical interests and the mitigation of search engine bias
Fortunato, S., Flammini, A., Menczer, F., & Vespignani, A. (2006) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0605525103 · Cited by 154 · see citing works
Website Quality Indicators for Consumers
Griffiths, K. M., & Christensen, H. M. (2005) · Journal of Medical Internet Research · doi:10.2196/jmir.7.5.e55 · Cited by 154 · see citing works
Approximating PageRank from In-Degree
Fortunato, S., Boguñá, M., Flammini, A., & Menczer, F. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-78808-9_6 · Cited by 130 · see citing works
Power law distributions in class relationships
Wheeldon, R., & Counsell, S. (2004) · IEEE International Working Conference on Source Code Analysis and Manipulation (SCAM) · doi:10.1109/scam.2003.1238030 · Cited by 130 · see citing works
Centrality Measures in Complex Networks: A SurveyPreprint
Saxena, A., & Iyengar, S. R. S. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2011.07190 · Cited by 123 · see citing works
Temporal Analysis of the Wikigraph
Buriol, L. S., Castillo, C., Donato, D., Leonardi, S., & Millozzi, S. (2006) · IEEE/WIC/ACM International Conference on Web Intelligence · doi:10.1109/wi.2006.164 · Cited by 119 · see citing works
Amitay, E., Carmel, D., Darlow, A., Lempel, R., & Soffer, A. (2003) · ACM Conference on Hypertext and Social Media (HT) · doi:10.1145/900051.900060 · Cited by 108 · see citing works
Characterization of national Web domains
Baeza-Yates, R. A., Castillo, C., & Efthimiadis, E. N. (2007) · ACM Transactions on Internet Technology · doi:10.1145/1239971.1239973 · Cited by 104 · see citing works
Baeza-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 · see citing works
Fast query execution for retrieval models based on path-constrained random walks
Lao, N., & Cohen, W. W. (2010) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1835804.1835916 · Cited by 99 · see citing works
The Graph Structure in the Web − Analyzed on Different Aggregation Levels
Meusel, R., Vigna, S., Lehmberg, O., & Bizer, C. (2015) · The Journal of Web Science · doi:10.1561/106.00000003 · Cited by 94 · see citing works
Quantum Google in a Complex Network
Paparo, G. D., Müller, M., Comellas, F., & Martin-Delgado, M. A. (2013) · Scientific Reports · doi:10.1038/srep02773 · Cited by 90 · see citing works
Exploiting the hierarchical structure for link analysis
Xue, G.-R., Yang, Q., Zeng, H.-J., Yu, Y., & Chen, Z. (2005) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/1076034.1076068 · Cited by 89 · see citing works
Updating Markov Chains with an Eye on Google's PageRank
Langville, A. N., & Meyer, C. D. (2006) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/040619028 · Cited by 86 · see citing works
Video interactions in online video social networks
Benevenuto, F., Rodrigues, T., Almeida, V. A. F., Almeida, J. M., & Ross, K. W. (2009) · ACM Transactions on Multimedia Computing Communications and Applications · doi:10.1145/1596990.1596994 · Cited by 84 · see citing works
Algorithmic Challenges in Web Search Engines
Henzinger, M. R. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129079 · Cited by 81 · see citing works
GRAPH THEORY AND COMPLEX NETWORKS
Duan, Z. (2008) · Lixue jinzhan · Cited by 76 · see citing works
Lempel, R., & Moran, S. (2005) · Information Retrieval · doi:10.1007/s10791-005-5661-0 · Cited by 73 · see citing works
Efficient PageRank approximation via graph aggregation
Broder, A. Z., Lempel, R., Maghoul, F., & Pedersen, J. (2006) · Information Retrieval · doi:10.1007/s10791-006-7146-1 · Cited by 72 · 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
Characteristics of the Web of Spain
Baeza-Yates, R. A., Castillo, C., & López, V. (2005) · DIGITAL.CSIC (Spanish National Research Council (CSIC)) · Cited by 69 · see citing works
In-Degree and PageRank: Why Do They Follow Similar Power Laws?
Litvak, N., Scheinhardt, W. R. W., & Volkovich, Y. (2007) · Internet Mathematics · doi:10.1080/15427951.2007.10129293 · Cited by 62 · see citing works
I/O-efficient techniques for computing pagerank
Chen, Y.-Y., Gan, Q., & Suel, T. (2002) · Proceedings of the eleventh international conference on Information and knowledge management · doi:10.1145/584792.584882 · Cited by 59 · see citing works
Pagerank Increase under Different Collusion Topologies.
Baeza-Yates, R. A., Castillo, C., & López, V. (2005) · Cited by 56 · see citing works
A Comparison of Sampling Techniques for Web Graph Characterization
Becchetti, L., Castillo, C., & Fazzone, A. (2006) · Cited by 54 · see citing works
Comparing classical and quantum PageRanks
Loke, T., Tang, J.-S., Rodriguez, J., SMALL, M. P., & Wang, J. B. (2016) · Quantum Information Processing · doi:10.1007/s11128-016-1456-z · Cited by 52 · see citing works
Manipulability of PageRank under Sybil Strategies
Cheng, A., & Friedman, E. (2006) · Cited by 50 · see citing works
Chakrabarti, D., & Faloutsos, C. (2012) · Synthesis lectures on data mining and knowledge discovery · doi:10.2200/s00449ed1v01y201209dmk006 · Cited by 49 · see citing works
The distribution of PageRank follows a power-law only for particular values of the damping factor
Becchetti, L., & Castillo, C. (2006) · Proceedings of the 15th international conference on World Wide Web · doi:10.1145/1135777.1135955 · Cited by 48 · see citing works
Quantifying and suppressing ranking bias in a large citation network
Vaccario, G., Medo, M., Wider, N., & Mariani, M. S. (2017) · Journal of Informetrics · doi:10.1016/j.joi.2017.05.014 · Cited by 46 · see citing works
PageRank of Scale-Free Growing Networks
Avrachenkov, K., & Lebedev, D. (2006) · Internet Mathematics · doi:10.1080/15427951.2006.10129120 · Cited by 44 · see citing works
RANDOM WALKS ON DIRECTED NETWORKS: THE CASE OF PAGERANK
Fortunato, S., & Flammini, A. (2007) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127407018439 · Cited by 44 · see citing works
Algorithms and Experiments for the Webgraph
Luigi Laura, A., Leonardi, S., Millozzi, S., Meyer, U., & Sibeyn, J. F. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-39658-1_63 · Cited by 43 · see citing works
Complex Systems, Information Technologies, and Tourism: A Network Point of View
Baggio, R. (2006) · Information Technology & Tourism · doi:10.3727/109830506778193850 · Cited by 40 · see citing works
Local weak convergence for PageRank
Garavaglia, A., van der Hofstad, R., & Litvak, N. (2020) · The Annals of Applied Probability · doi:10.1214/19-aap1494 · Cited by 39 · see citing works
How to make the top ten: Approximating PageRank from in-degreePreprint
Fortunato, S., Boguñá, M., Flammini, A., & Menczer, F. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0511016 · Cited by 39 · see citing works
Inequality and inequity in network-based ranking and recommendation algorithms
Espín-Noboa, L., Wagner, C., Strohmaier, M., & Karimi, F. (2022) · Scientific Reports · doi:10.1038/s41598-022-05434-1 · Cited by 38 · see citing works
Efficient pagerank approximation via graph aggregation
Broder, A., Lempel, R., Maghoul, F., & Pedersen, J. (2004) · International World Wide Web Conference (WWW) · doi:10.1145/1013367.1013537 · Cited by 35 · see citing works
Νικολακόπουλος, Α. Ν., & Garofalakis, J. D. (2013) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/2433396.2433415 · Cited by 34 · see citing works
Using spam farm to boost PageRank
Du, Y., Shi, Y., & Zhao, X. (2007) · Adversarial Information Retrieval on the Web · doi:10.1145/1244408.1244415 · Cited by 34 · see citing works
SpamRank - fully automatic link spam detection. Work in progress
Benczúr, A. A., Csalogány, K., Sarlós, K., & Uher, M. (2005) · SZTAKI Publication Repository (Hungarian Academy of Sciences) · Cited by 32 · see citing works
Lehmberg, O., Meusel, R., & Bizer, C. (2014) · ACM Web Science Conference (WebSci) · doi:10.1145/2615569.2615674 · Cited by 32 · see citing works
Index design and query processing for graph conductance search
Chakrabarti, S., Pathak, A. K., & Gupta, M. (2010) · The VLDB Journal · doi:10.1007/s00778-010-0204-8 · Cited by 32 · see citing works
Determining Factors Behind the PageRank Log-Log Plot
Volkovich, Y., Litvak, N., & Donato, D. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-77004-6_9 · Cited by 31 · see citing works
PageRank in Scale-Free Random Graphs
Chen, N., Litvak, N., & Olvera‐Cravioto, M. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-13123-8_10 · Cited by 30 · see citing works
Generalized preferential attachment considering aging
Wu, Y., Fu, T. Z. J., & Chiu, D. M. (2014) · Journal of Informetrics · doi:10.1016/j.joi.2014.06.002 · Cited by 30 · see citing works
PageRank and the random surfer model
Chebolu, P., & Melsted, P. (2008) · Symposium on Discrete Algorithms · Cited by 30 · see citing works
Quantifying and suppressing ranking bias in a large citation network
Vaccario, G., Medo, M., Wider, N., & Mariani, M. S. (2017) · reroDoc Digital Library · doi:10.7892/boris.108621 · Cited by 28 · see citing works
On Local Estimations of PageRank: A Mean Field Approach
Fortunato, S., Boguñá, M., Flammini, A., & Menczer, F. (2007) · Internet Mathematics · doi:10.1080/15427951.2007.10129294 · Cited by 27 · see citing works
Interactive Random Graph Generation with Evolutionary Algorithms
Bach, B., Spritzer, A. S., Lutton, É., & Fekete, J. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-36763-2_48 · Cited by 24 · see citing works
A Parametric Model Approach for Structural Reconstruction of Scale-Free Networks
Pandey, P. K., & Adhikari, B. (2017) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2017.2725264 · Cited by 23 · see citing works
Chakrabarti, D., & Faloutsos, C. (2005) · Cited by 22 · see citing works
Graph Mining: Laws and Generators
Chakrabarti, D., Faloutsos, C., & McGlohon, M. (2010) · The Kluwer international series on advances in database systems · doi:10.1007/978-1-4419-6045-0_3 · Cited by 21 · see citing works
Using SiteRank for Decentralized Computation of Web Document Ranking
Wu, J. Y., & Aberer, K. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-27780-4_30 · Cited by 21 · see citing works
PageRank on inhomogeneous random digraphs
Lee, J., & Olvera‐Cravioto, M. (2019) · Stochastic Processes and their Applications · doi:10.1016/j.spa.2019.07.002 · Cited by 20 · see citing works
Quantum Google algorithm: Construction and application to complex networks
Paparo, G. D., Müller, M., Comellas, F., & Martin-Delgado, M. A. (2014) · The European Physical Journal Plus · doi:10.1140/epjp/i2014-14150-y · Cited by 17 · see citing works
Characterization of the Argentinian Web
Tolosa, G. H., Bordignon, F. R. A., Baeza-Yates, R. A., & Castillo, C. (2007) · DIGITAL.CSIC (Spanish National Research Council (CSIC)) · Cited by 17 · see citing works
Using SiteRank for P2P Web Retrieval
Wu, J. Y., & Aberer, K. (2004) · Cited by 17 · see citing works
Traffic-Driven Model of the World Wide Web Graph
Barrat, A., Barthélemy, M., & Vespignani, A. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30216-2_5 · Cited by 16 · see citing works
Multiple-Goal Heuristic Search
Davidov, D., & Markovitch, S. (2006) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1940 · Cited by 16 · see citing works
Multimodal Brain Network Jointly Construction and Fusion for Diagnosis of Epilepsy
Zhu, Q., Yang, J., Xu, B., Hou, Z., Sun, L., & Zhang, D. (2021) · Frontiers in Neuroscience · doi:10.3389/fnins.2021.734711 · Cited by 15 · see citing works
Web Information Retrieval Using Query Independent Page Rank Algorithm
Taneja, H., & Gupta, R. (2010) · International Conference on Advances in Computer Engineering · doi:10.1109/ace.2010.72 · Cited by 14 · see citing works
Simulating the Webgraph: a comparative analysis of models
Donato, D., Luigi Laura, A., Leonardi, S., & Millozzi, S. (2004) · Computing in Science & Engineering · doi:10.1109/mcse.2004.73 · Cited by 14 · see citing works
Scalable and Reliable Collaborative Spam Filters: Harnessing the Global Social Email Networks.
Kong, J. S., Boykin, P. O., Rezaei, B., Sarshar, N., & Roychowdhury, V. (2005) · Cited by 14 · see citing works
Kirchhoff, L., Bruns, A., & Nicolaï, T. (2007) · Alexandria (UniSG) (University of St.Gallen) · Cited by 13 · see citing works
Probabilistic Relation between In-Degree and PageRank
Litvak, N., Scheinhardt, W., & Volkovich, Y. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-78808-9_7 · Cited by 13 · see citing works
Ranking Pages by Topology and Popularity within Web Sites
Borges, J. L., & Mark Levene, A. (2006) · World Wide Web · doi:10.1007/s11280-006-8558-y · Cited by 13 · see citing works
Efficient Encodings for Document Ranking Vectors
Haveliwala, T. H. (2002) · Cited by 13 · see citing works
Neighbourhood maps: decentralised ranking in small-world P2P networks
Dell’Amico, M. (2006) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps.2006.1639702 · Cited by 13 · see citing works
PageRank asymptotics on directed preferential attachment networks
Banerjee, S., & Olvera‐Cravioto, M. (2022) · The Annals of Applied Probability · doi:10.1214/21-aap1757 · Cited by 12 · see citing works
Searching Steiner trees for web graph query
Lee, W., Loh, W.-K., & Sohn, M. M. (2011) · Computers & Industrial Engineering · doi:10.1016/j.cie.2011.11.013 · Cited by 12 · see citing works
Evolution of page popularity under random web graph models
Motwani, R., & Xu, Y. (2006) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/1142351.1142372 · Cited by 12 · see citing works
Information Retrieval on the Web and its Evaluation
Garg, D., & Sharma, D. (2012) · International Journal of Computer Applications · doi:10.5120/5025-7170 · Cited by 12 · see citing works
Algorithms and Experiments for the Webgraph
Donato, D., Luigi Laura, A., Leonardi, S., Meyer, U., Millozzi, S., & Sibeyn, J. F. (2006) · Journal of Graph Algorithms and Applications · doi:10.7155/jgaa.00125 · Cited by 12 · see citing works
Self-Organizing Referral Networks: A Process View of Trust and Authority
Yolum, P., & Singh, M. P. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24701-2_14 · Cited by 12 · see citing works
Marcin Sydow, A. (2004) · International World Wide Web Conference (WWW) · doi:10.1145/1010432.1010536 · Cited by 11 · see citing works
The mobile web is structurally different
Jindal, A., Crutchfield, C., Goel, S., Kolluri, R., & Jain, R. (2008) · IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) · doi:10.1109/infocom.2008.4544648 · Cited by 11 · see citing works
Can One Out-Link Change Your PageRank?
Marcin Sydow, A. (2005) · Lecture notes in computer science · doi:10.1007/11495772_63 · Cited by 10 · see citing works
Rankings in directed configuration models with heavy tailed in-degrees
Cai, X. S., Caputo, P., Perarnau, G., & Quattropani, M. (2023) · The Annals of Applied Probability · doi:10.1214/23-aap1955 · Cited by 10 · see citing works
Adaptive Hierarchical Surrogate for Searching Web with Mobile Devices
Lee, W., Kang, S., Lim, S.-K., Shin, M.-K., & Kim, Y. (2007) · IEEE Transactions on Consumer Electronics · doi:10.1109/tce.2007.381762 · Cited by 10 · see citing works
Efficient Random Walk Inference with Knowledge Bases
Lao, N. (2025) · doi:10.1184/r1/28840673 · Cited by 9 · see citing works
The static absorbing model for the web
Plachouras, V., Ounis, I., & Amati, G. (2005) · Journal of Web Engineering · Cited by 9 · see citing works
Afrati, F., Das, G., Gionis, A., Mannila, H., Mielikäinen, T., & Tsaparas, P. (2006) · Proceedings · doi:10.1109/icdm.2005.94 · Cited by 9 · see citing works
Ranking algorithms on directed configuration networksPreprint
Chen, N., Litvak, N., & Olvera‐Cravioto, M. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1409.7443 · Cited by 9 · see citing works
Measuring extremal dependencies in web graphs
Volkovich, Y., Litvak, N., & Zwart, B. (2008) · International World Wide Web Conference (WWW) · doi:10.1145/1367497.1367682 · Cited by 8 · see citing works
Identification of clusters in the Web graph based on link topology
Huang, X., & Lai, W. (2003) · International Database Engineering and Applications Symposium (IDEAS) · doi:10.1109/ideas.2003.1214919 · Cited by 8 · see citing works
Document ranking using web evidence
Upstill, T. (2005) · ANU Open Research (Australian National University) · doi:10.25911/5d626d4ac56b6 · Cited by 8 · see citing works
Structural top-k Web navigation with inclusive query
Lee, W., & Leung, C. K.-S. (2009) · IEEE International Conference on Industrial Technology (ICIT) · doi:10.1109/icit.2009.4939712 · Cited by 7 · see citing works
- Authors
- Pandurangan, G., Raghavan, P., & Upfal, E.
- Affiliations
- Brown University (US)
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2002
- Pages
- 330-339
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W2170582301
- Cited by
- 164
- References
- 23
- Citations by year
- 2025: 2 · 2024: 2 · 2023: 3 · 2022: 3 · 2021: 1 · 2020: 2 · 2019: 4 · 2018: 1 · 2017: 3 · 2016: 3 · 2015: 4 · 2014: 8 · 2013: 6 · 2012: 6
- FWCI
- 33.20
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Lecture notes in computer science (publishedVersion)
- Topics
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
- Physical Sciences › Computer Science › Information Systems › Information Retrieval and Search Behavior
- Physical Sciences › Computer Science › Information Systems › Web visibility and informetrics
- Keywords
- PageRank, web graph, power-law distribution, degree distribution, search engine indexing, graph model, heavy-tailed distributions
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
