<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>PageRank on Jeanphilo Blog</title><link>https://shio-chan-dev.github.io/jeanblog/tags/pagerank/</link><description>Recent content in PageRank on Jeanphilo Blog</description><generator>Hugo -- 0.160.0</generator><language>en-us</language><lastBuildDate>Mon, 09 Feb 2026 10:05:33 +0800</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/tags/pagerank/index.xml" rel="self" type="application/rss+xml"/><item><title>Practical Graph Computation Models: How Pregel (BSP) and GAS Run PageRank/CC/Parallel BFS</title><link>https://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/110-graph-computation-models-pregel-gas-parallel-bfs/</link><pubDate>Mon, 09 Feb 2026 10:05:33 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/110-graph-computation-models-pregel-gas-parallel-bfs/</guid><description>An engineering implementation framework centered on graph computation models: core abstractions, synchronization semantics, performance boundaries of Pregel and GAS, plus implementation and selection guidance for PageRank/CC/parallel BFS.</description></item><item><title>Dynamic Graphs and Incremental Computation: ACERS Guide to Incremental Shortest Path, Incremental PageRank, and Connectivity Maintenance</title><link>https://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/90-dynamic-graph-incremental-computation/</link><pubDate>Mon, 09 Feb 2026 10:00:28 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/90-dynamic-graph-incremental-computation/</guid><description>For real-world graph systems, this article systematically explains dynamic graph incremental algorithms: incremental shortest path, incremental PageRank, and connectivity maintenance. It focuses on three core engineering techniques: local recomputation, lazy updates, and approximate results.</description></item><item><title>PageRank / Personalized PageRank: Node Importance and Incremental Updates in Graph Databases - ACERS Analysis</title><link>https://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/60-pagerank-and-personalized-pagerank/</link><pubDate>Mon, 09 Feb 2026 09:54:25 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/60-pagerank-and-personalized-pagerank/</guid><description>A systematic explanation of PageRank and Personalized PageRank, from iterative computation and sparse-matrix implementation to incremental update strategies, covering core graph-database scenarios such as recommendation and influence analysis.</description></item></channel></rss>