On the public citation graph

Incremental iteration method for fast PageRank computation

0 signed · 22 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.

Claim with ORCID

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.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11899402_1openalex-snapshot

Mining Temporally Changing Web Usage Graphs

inferredcites →https://doi.org/10.1016/0024-3795(86)90152-7openalex-snapshot

Stationary distributions of perturbed Markov chains

inferredcites →https://doi.org/10.1016/j.laa.2003.12.041openalex-snapshot

The life and work of A.A. Markov

inferredcites →https://doi.org/10.1016/s1389-1286(00)00034-7openalex-snapshot

The stochastic approach for link-structure analysis (SALSA) and the TKC effect

inferredcites →https://doi.org/10.1137/1.9781611971163openalex-snapshot

The Symmetric Eigenvalue Problem

inferredcites →https://doi.org/10.1145/1062745.1062885openalex-snapshot

Incremental page rank computation on evolving graphs

inferredcites →https://doi.org/10.1145/324133.324140openalex-snapshot

Authoritative sources in a hyperlinked environment

inferredcites →https://doi.org/10.1145/775152.775190openalex-snapshot

Extrapolation methods for accelerating PageRank computations

inferredcites →https://doi.org/10.1515/9781400830329openalex-snapshot

Google's PageRank and Beyond

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4869677openalex-extracted

Efficient Gpu Implementation of Static and Incrementally Expanding Df-P Pagerank for Dynamic Graphs

inferred← citeshttps://doi.org/10.1007/978-3-030-36687-2_17openalex-snapshot

Identifying, Ranking and Tracking Community Leaders in Evolving Social Networks

inferred← citeshttps://doi.org/10.1007/978-3-031-69583-4_22openalex-snapshot

DF* PageRank: Incrementally Expanding Approaches for Updating PageRank on Dynamic Graphs

inferred← citeshttps://doi.org/10.1007/978-3-319-46227-1_42openalex-snapshot

Temporal PageRank

inferred← citeshttps://doi.org/10.1007/s10489-017-0990-4openalex-snapshot

An evolutionary non-linear ranking algorithm for ranking scientific collaborations

inferred← citeshttps://doi.org/10.1007/s11227-020-03265-3openalex-snapshot

DiffPageRank: an efficient differential PageRank approach in MapReduce

inferred← citeshttps://doi.org/10.1007/s41109-018-0080-5openalex-snapshot

Temporal walk based centrality metric for graph streams

inferred← citeshttps://doi.org/10.1109/access.2022.3149296openalex-snapshot

Towards PageRank Update in a Streaming Graph by Incremental Random Walk

inferred← citeshttps://doi.org/10.1109/bigdatacongress.2016.18openalex-snapshot

Distributed Incremental Graph Analysis

inferred← citeshttps://doi.org/10.1109/glocom.2017.8255085openalex-snapshot

Interest- and Content-Based Data Dissemination in Mobile Social Networks

inferred← citeshttps://doi.org/10.1109/ipdpsw63119.2024.00148openalex-snapshot

Lock-free Computation of PageRank in Dynamic Graphs

inferred← citeshttps://doi.org/10.1109/sci68648.2025.11333866openalex-snapshot

GPU-Accelerated Dynamic Frontier PageRank

inferred← citeshttps://doi.org/10.5772/intechopen.79041openalex-snapshot

Evolving Networks and Social Network Analysis Methods and Techniques

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.