What does Local Pack Ranking and Lead Capture conclude, in numbers, about “Prominence: the Logarithmic Margin of Review Counts, Bayesian Averages and Recent Velocity”?

Answer: Prominence has three parts. The count term is logarithmic: the marginal gain from the next review falls from 0.03008 to 0.00010, and an established store cannot pile up enough reviews to offset half a kilometre. The rating term is sensitive to bad reviews: with only 10 reviews, a single one-star review needs 63 further reviews to absorb. The velocity term is half-life weighted: the index bought by a burst is a remnant after six months, and only a steady flow of customers gives a steady index.

Scope of the numbers: Parameters are illustrative and all calculations are generated by the book's programs. This is not legal or marketing-compliance advice; platform policies and laws are governed by their current official texts and change over time.

中文版

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.00010, 0.03008

nnext onenext tenoffset +0.5 kmoffset +1 km
50.030080.1913845771
200.007290.061072618,857
500.002670.0246490249,873
1000.001240.011882,343188,742
3000.000370.0036210,7591,583,338
1,0000.000100.0009757,56316,444,971
doubling a large n adds about a ln 2 = 0.2079 to P
Show the full program
# Chapter 3. p31: the next review is worth less and less.
# Count term of the illustrative prominence: P(n) = 1 + a ln(1 + n),
# a = 0.30. Distance term exp(-d / 1.5 km). For a store with n reviews
# we print the gain from one more review, from ten more, and the
# review count that would offset a searcher 0.5 km or 1 km further
# away. Illustrative weights only, not Google's.
import math

A, D0 = 0.30, 1.5


def prom(n):
    return 1.0 + A * math.log1p(n)


def offset_count(n, extra_km):
    need = prom(n) * math.exp(extra_km / D0)
    return math.expm1((need - 1.0) / A)


if __name__ == "__main__":
    print("     n  next one   next ten   offset +0.5 km   offset +1 km")
    for n in (5, 20, 50, 100, 300, 1000):
        g1 = prom(n + 1) / prom(n) - 1.0
        g10 = prom(n + 10) / prom(n) - 1.0
        print("{:>6,}  {:.5f}   {:.5f}   {:>14,.0f}   {:>12,.0f}".format(
            n, g1, g10, offset_count(n, 0.5), offset_count(n, 1.0)))
    print("doubling a large n adds about a ln 2 = {:.4f} to P".format(
        A * math.log(2.0)))

Single source and citation

Fan, Y. (2026). Local-Pack Search Ranking Factors, Review-Velocity Signalling and High-Urgency Geo-Intent Lead Capture (Version 1.0.0), Chapter 3: Prominence: the Logarithmic Margin of Review Counts, Bayesian Averages and Recent Velocity. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-369 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026369,
  author    = {Fan, Yafu},
  title     = {Local-Pack Search Ranking Factors, Review-Velocity Signalling and High-Urgency Geo-Intent Lead Capture},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book