On the public citation graph
Ordinal Ranking for Google's PageRank
0 signed · 62 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11735106_9openalex-snapshot
Beyond the Web: Retrieval in Social Information Spaces
inferredcites →https://doi.org/10.1007/978-3-540-71701-0_95openalex-snapshot
Keyword Extraction Based on PageRank
inferredcites →https://doi.org/10.1007/978-3-540-77004-6_13openalex-snapshot
Local Partitioning for Directed Graphs Using PageRank
inferredcites →https://doi.org/10.1007/s00211-003-0470-0openalex-snapshot
On the powers of a matrix with perturbations
inferredcites →https://doi.org/10.1007/s10543-006-0091-yopenalex-snapshot
An Arnoldi-type algorithm for computing page rank
inferredcites →https://doi.org/10.1016/b978-012088469-8.50039-5openalex-snapshot
Computing PageRank in a Distributed Internet Search System
inferredcites →https://doi.org/10.1016/j.jaad.2007.03.005openalex-snapshot
Refining dermatology journal impact factors using PageRank
inferredcites →https://doi.org/10.1016/j.joi.2006.06.001openalex-snapshot
Finding scientific gems with Google’s PageRank algorithm
inferredcites →https://doi.org/10.1016/j.laa.2006.03.007openalex-snapshot
Conditioning of the entries in the stationary vector of a Google-type matrix
inferredcites →https://doi.org/10.1016/s0169-7552(98)00110-xopenalex-snapshot
The anatomy of a large-scale hypertextual Web search engine
inferredcites →https://doi.org/10.1017/s0001867800022941openalex-snapshot
Perturbation bounds for the stationary probabilities of a finite Markov chain
inferredcites →https://doi.org/10.1080/15427951.2005.10129098openalex-snapshot
A Survey on PageRank Computing
inferredcites →https://doi.org/10.1137/050626612openalex-snapshot
The PageRank Vector: Properties, Computation, Approximation, and Acceleration
inferredcites →https://doi.org/10.1137/060664331openalex-snapshot
PageRank Computation, with Special Attention to Dangling Nodes
inferredcites →https://doi.org/10.1137/s0036144503424786openalex-snapshot
A Survey of Eigenvector Methods for Web Information Retrieval
inferredcites →https://doi.org/10.1137/s0895479804441407openalex-snapshot
Jordan Canonical Form of the Google Matrix: A Potential Contribution to the PageRank Computation
inferredcites →https://doi.org/10.1145/1052934.1052942openalex-snapshot
Link analysis ranking: algorithms, theory, and experiments
inferredcites →https://doi.org/10.1145/1135777.1135823openalex-snapshot
To randomize or not to randomize
inferredcites →https://doi.org/10.1145/1135777.1135883openalex-snapshot
Automatic identification of user interest for personalized search
inferredcites →https://doi.org/10.1145/1150402.1150419openalex-snapshot
Estimating the global pagerank of web communities
inferredcites →https://doi.org/10.1145/775152.775190openalex-snapshot
Extrapolation methods for accelerating PageRank computations
inferredcites →https://doi.org/10.1186/1471-2105-6-233openalex-snapshot
GeneRank: Using search engine technology for the analysis of microarray experiments
inferredcites →https://doi.org/10.3115/1220355.1220517openalex-snapshot
PageRank on semantic networks, with application to word sense disambiguation
inferredcites →https://doi.org/10.48550/arxiv.math/0401177openalex-snapshot
A Note on the Eigenvalues of the Google Matrix
inferredcites →https://doi.org/10.5860/choice.34-0981openalex-snapshot
Accuracy and stability of numerical algorithms
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781119597568.ch10openalex-snapshot
Evaluation of Stopping Criteria for Ranks in Solving Linear Systems
inferred← citeshttps://doi.org/10.1002/nla.2541openalex-snapshot
Preconditioned weighted full orthogonalization method for solving singular linear systems from PageRank problems
inferred← citeshttps://doi.org/10.1007/978-3-032-18920-2_39openalex-snapshot
Sensitivity to the Damping Factor in Local Markov Consensus Methods
inferred← citeshttps://doi.org/10.1007/s10092-016-0186-zopenalex-snapshot
On the convergence of the minimally irreducible Markov chain method with applications to PageRank
inferred← citeshttps://doi.org/10.1007/s10791-012-9183-2openalex-snapshot
Lumping algorithms for computing Google’s PageRank and its derivative, with attention to unreferenced nodes
inferred← citeshttps://doi.org/10.1007/s10915-022-01976-8openalex-snapshot
Red Light Green Light Method for Solving Large Markov Chains
inferred← citeshttps://doi.org/10.1016/j.aam.2025.102900openalex-snapshot
Influence of the automorphism group of a graph on its PageRank scores of vertices
inferred← citeshttps://doi.org/10.1016/j.cam.2014.09.022openalex-snapshot
A two-step matrix splitting iteration for computing PageRank
inferred← citeshttps://doi.org/10.1016/j.cam.2016.10.020openalex-snapshot
A note on the two-step matrix splitting iteration for computing PageRank
inferred← citeshttps://doi.org/10.1016/j.jda.2009.11.001openalex-snapshot
Choose the damping, choose the ranking?
inferred← citeshttps://doi.org/10.1080/15427951.2013.814092openalex-snapshot
A Dynamical System for PageRank with Time-Dependent Teleportation
inferred← citeshttps://doi.org/10.1109/tpds.2010.119openalex-snapshot
Site-Based Partitioning and Repartitioning Techniques for Parallel PageRank Computation
inferred← citeshttps://doi.org/10.1137/080727397openalex-snapshot
An Inner-Outer Iteration for Computing PageRank
inferred← citeshttps://doi.org/10.1137/090752948openalex-snapshot
Ergodicity Coefficients Defined by Vector Norms
inferred← citeshttps://doi.org/10.1137/090762002openalex-snapshot
HITS Can Converge Slowly, But Not Too Slowly, in Score and Rank
inferred← citeshttps://doi.org/10.1137/10080659xopenalex-snapshot
Importance Sampling for a Monte Carlo Matrix Multiplication Algorithm, with Application to Information Retrieval
inferred← citeshttps://doi.org/10.1145/1777432.1777434openalex-snapshot
Arnoldi versus GMRES for computing pageRank
inferred← citeshttps://doi.org/10.1145/2063576.2063670openalex-snapshot
Local computation of PageRank
inferred← citeshttps://doi.org/10.1145/2806416.2806610openalex-snapshot
Gauging Correct Relative Rankings For Similarity Search
inferred← citeshttps://doi.org/10.1155/2013/438987openalex-snapshot
An Improved Approach to the PageRank Problems
inferred← citeshttps://doi.org/10.1155/2014/418605openalex-snapshot
A Model Based on Cocitation for Web Information Retrieval
inferred← citeshttps://doi.org/10.1515/math-2020-0120openalex-snapshot
A multi-power and multi-splitting inner-outer iteration for PageRank computation
inferred← citeshttps://doi.org/10.36045/bbms/1257776244openalex-snapshot
Versatile weighting strategies for a citation-based research evaluation model
inferred← citeshttps://doi.org/10.48550/arxiv.1211.4266openalex-snapshot
A Dynamical System for PageRank with Time-Dependent Teleportation
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.