What does Long-Tail Information Gain and Indexation conclude, in numbers, about “The Zipf Long Tail: Head, Tail and Intent-Weighted Cash”?

Answer: Start with the row for \(s = 1.0\). The top 100 queries take 0.4291 of all searches, and the queries beyond position 1,000 together take 0.3809. The head is heavy and the tail is long, and the two are of the same order. The last column adds a sharper fact: from position 82,712 onwards a query expects fewer than one search a month, so 82,711 queries reach at least one a month. The lower half of the table makes the decline concrete. The top query receives 82,711.99 searches a month, the query at position 1,000 only 82.71, the one at 10,000 receives 8.27, and the one at 50,000 receives 1.65.

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: 0.3809, 0.4291, 1.0, 1.65, 100, 1000

N100,000 queries, V = 1,000,000 searches a month
s top-100 beyond-1,000 rank<1/mo queries>1/mo
0.80.1785 0.6605 none 100,000
1.00.4291 0.3809 82,712 82,711
1.20.7076 0.1484 25,761 25,760
s1.0, expected searches a month at rank r
r1: 82,711.99
r10: 8,271.20
r100: 827.12
r1,000: 82.71
r10,000: 8.27
r50,000: 1.65
Show the full program
# Chapter 1. p11: head and tail shares of a Zipf query distribution.
# Model: a niche has N distinct queries; the query of rank r receives a
# share r^(-s) / H(N, s) of V monthly searches (Zipf 1949). We report the
# share of the top 100 queries, the share beyond rank 1,000, and the rank
# beyond which a query expects fewer than one search a month.
# N, V and s are illustrative parameters, not measured volumes.
import math

N = 100000
V = 1000000


def harmonic(n, s):
    return math.fsum(r ** -s for r in range(1, n + 1))


def share(lo, hi, s, h):
    return math.fsum(r ** -s for r in range(lo, hi + 1)) / h


def rank_below_one(s, h):
    # smallest r with V * r^(-s) / h < 1
    r = (V / h) ** (1.0 / s)
    return int(math.floor(r)) + 1


if __name__ == "__main__":
    print("N = {:,} queries, V = {:,} searches a month".format(N, V))
    print("    s   top-100  beyond-1,000  rank<1/mo  queries>=1/mo")
    for s in (0.8, 1.0, 1.2):
        h = harmonic(N, s)
        top = share(1, 100, s, h)
        tail = share(1001, N, s, h)
        rb = rank_below_one(s, h)
        cut = "{:,}".format(rb) if rb <= N else "none"
        print("  {:.1f}   {:.4f}      {:.4f}    {:>8}     {:>8,}".format(
            s, top, tail, cut, min(rb - 1, N)))
    h = harmonic(N, 1.0)
    print("s = 1.0, expected searches a month at rank r")
    for r in (1, 10, 100, 1000, 10000, 50000):
        print("  r = {:>6,}: {:>12,.2f}".format(r, V / (h * r)))

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 1: The Zipf Long Tail: Head, Tail and Intent-Weighted Cash. 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