What does Local Pack Ranking and Lead Capture conclude, in numbers, about “Three Factors Multiplied: the Product Structure of Relevance, Distance and Prominence”?
Answer: Chapters 1 and 2 cover the product structure of the three factors, Huff's gravity model and distance decay, and how to read a five-by-five rank grid and its scan noise.
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 only
A. own Huff share by distance and attractiveness S d km S=100 S=200 S=400 0.5 0.6221 0.7671 0.8682 1.0 0.2916 0.4515 0.6221 1.5 0.1547 0.2679 0.4226 2.0 0.0933 0.1707 0.2916 3.0 0.0437 0.0838 0.1547 4.0 0.0251 0.0489 0.0933 B. S multiplier that offsets a longer distance distance x1.5: S x 2.25 distance x2.0: S x 4.00 distance x3.0: S x 9.00 C. same question under exp(-d / d0), d0 = 1.5 km +0.5 km: S x 1.396 +1.0 km: S x 1.948 +2.0 km: S x 3.794
Show the full program
# Chapter 1. p11: Huff gravity shares, distance against attractiveness.
# Model (Huff 1963): a searcher at the origin picks store j with
# probability S_j^alpha / T_j^beta, normalised over all stores.
# S is an attractiveness index, T the distance in km. alpha = 1 and
# beta = 2 are illustrative, not estimates for any real market and
# not Google weights. Three rival stores sit at 1.0, 1.5 and 2.5 km.
import math
ALPHA, BETA = 1.0, 2.0
RIVALS = [(100.0, 1.0), (300.0, 1.5), (60.0, 2.5)]
def huff_share(s_own, d_own, rivals=RIVALS, a=ALPHA, b=BETA):
own = s_own ** a / d_own ** b
rest = [s ** a / d ** b for s, d in rivals]
return own / math.fsum([own] + rest)
def offset_multiplier(dist_ratio, a=ALPHA, b=BETA):
# attractiveness factor that exactly offsets a distance ratio
return dist_ratio ** (b / a)
if __name__ == "__main__":
print("A. own Huff share by distance and attractiveness S")
print(" d km S=100 S=200 S=400")
for d in (0.5, 1.0, 1.5, 2.0, 3.0, 4.0):
row = [huff_share(s, d) for s in (100.0, 200.0, 400.0)]
print(" {:>4.1f} {:.4f} {:.4f} {:.4f}".format(d, *row))
print("B. S multiplier that offsets a longer distance")
for ratio in (1.5, 2.0, 3.0):
print(" distance x{:.1f}: S x {:.2f}".format(
ratio, offset_multiplier(ratio)))
print("C. same question under exp(-d / d0), d0 = 1.5 km")
for extra in (0.5, 1.0, 2.0):
print(" +{:.1f} km: S x {:.3f}".format(
extra, math.exp(extra / 1.5)))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 1: Three Factors Multiplied: the Product Structure of Relevance, Distance and Prominence. 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
- Chapter 2 · Distance Decay: Gravity Curves, the Edge of the Trade Area and a Five-by-Five Rank Grid
- Chapter 3 · Prominence: the Logarithmic Margin of Review Counts, Bayesian Averages and Recent Velocity
- Chapter 4 · Compliant Review Velocity: the Invitation Funnel, Poisson Intervals and "Top Three" as a Simulated Quantile
- Chapter 5 · Capture: Erlang Queues, the Twenty-Second Answer Rate and Answering Seats
- Chapter 6 · Tiers of Urgency: Today, This Week, This Month and the Order of Call-Backs
- Chapter 7 · Classical Sources: Timing, Place and Harmony, Virtue with Neighbours, and a Good Name over Great Riches
- Chapter 8 · Closing the Loop: the Weekly Same-City Map Ledger, Calculators and Risk-Control Tables