What does Long-Tail Information Gain and Indexation conclude, in numbers, about “Internal-Link Topology: the PageRank Funnel and the Stationary Share of the Inquiry Page”?
Answer: Chapter 4 compares four internal-link topologies; the funnel lifts the inquiry page to 7.12 times the uniform share and visitors reach it in 2.84 clicks on average.
Scope of the numbers: Parameters are illustrative and all calculations come from the book's programs. This is general business analysis, not personalised advice: property content is not legal, tax or investment advice, the tarot material offers no personal readings, and all data are synthetic.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 7.12
| topology | checkout | x uniform | hubs | tails | home |
|---|---|---|---|---|---|
| mesh | 0.0286 | 1.00 | 0.0857 | 0.8571 | 0.0286 |
| islands | 0.0063 | 0.22 | 0.0190 | 0.9650 | 0.0097 |
| hub-spoke | 0.0154 | 0.54 | 0.4533 | 0.4788 | 0.0524 |
| funnel | 0.2033 | 7.12 | 0.2760 | 0.3240 | 0.1967 |
| funnel total mass check 1.000000 |
Show the full program
# Chapter 4. p41: where internal PageRank settles under four link
# topologies (Brin and Page 1998; Page et al. 1999). A 35-page site:
# home (0), three topic hubs (1-3), ten long-tail pages per hub (4-33)
# and one inquiry page, the "checkout" (34). Power iteration with
# damping 0.85; dangling pages spread their mass evenly. This is the
# textbook random-surfer model of internal links only, not a ranking
# formula used by any search engine today.
import math
N, HOME, CHECK = 35, 0, 34
HUBS = [1, 2, 3]
def tails(h):
return list(range(4 + 10 * (h - 1), 14 + 10 * (h - 1)))
def build(kind):
out = {i: [] for i in range(N)}
if kind == "mesh":
for i in range(N):
out[i] = [j for j in range(N) if j != i]
return out
out[HOME] = HUBS + [CHECK]
out[CHECK] = [HOME]
for h in HUBS:
ts = tails(h)
if kind == "islands":
out[h] = ts
for t in ts:
out[t] = [x for x in ts if x != t]
elif kind == "hub-spoke":
out[h] = ts + [HOME]
for t in ts:
out[t] = [h]
elif kind == "funnel":
out[h] = ts + [CHECK, HOME]
for t in ts:
out[t] = [h, CHECK]
return out
def pagerank(out, d=0.85, iters=200):
pr = [1.0 / N] * N
for _ in range(iters):
dang = math.fsum(pr[i] for i in range(N) if not out[i])
inflow = [[] for _ in range(N)]
for i in range(N):
for j in out[i]:
inflow[j].append(pr[i] / len(out[i]))
pr = [(1 - d) / N + d * (math.fsum(inflow[j]) + dang / N)
for j in range(N)]
return pr
if __name__ == "__main__":
print("topology checkout x uniform hubs tails home")
for kind in ("mesh", "islands", "hub-spoke", "funnel"):
pr = pagerank(build(kind))
hubs = math.fsum(pr[h] for h in HUBS)
tl = math.fsum(pr[4:34])
print("{:<10} {:.4f} {:>5.2f} {:.4f} {:.4f} {:.4f}".format(
kind, pr[CHECK], pr[CHECK] * N, hubs, tl, pr[HOME]))
pr = pagerank(build("funnel"))
print("funnel total mass check {:.6f}".format(math.fsum(pr)))Single source and citation
Fan, Y. (2026). Programmatic SEO Long-Tail Topology, Rapid Indexation and High-Intent Organic Traffic Harvesting across Multi-Domain Fleets (Version 1.0.0), Chapter 4: Internal-Link Topology: the PageRank Funnel and the Stationary Share of the Inquiry Page. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-346 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026346,
author = {Fan, Yafu},
title = {Programmatic SEO Long-Tail Topology, Rapid Indexation and High-Intent Organic Traffic Harvesting across Multi-Domain Fleets},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · The Zipf Long Tail: Head, Tail and Intent-Weighted Cash
- Chapter 2 · The Keyword Matrix: Cartesian Products, Feasible Cells and the First Hundred Pages
- Chapter 3 · A Floor on Information Gain: Shingles, SimHash and Unique Facts per Page
- Chapter 5 · The Indexation Schedule: Poisson Discovery, Host Queues and Batch Launches in the First Thirty Days
- Chapter 6 · A Fleet of Domains: Independent Value, a Division of Queries and hreflang Clusters
- Chapter 7 · Reading the Sources: Zheng Qiao's Classes in the Tongzhi and Vannevar Bush's Associative Trails
- Chapter 8 · Closing the Loop: the Batch Ledger, the Information-Gain and Indexation Scheduler, and Pre-Registered Refutation