What does Pruning a Domain Portfolio conclude, in numbers, about “Rank, Clicks and Direct Navigation: Where the Moat of a Geo-Exact Name Comes From”?
Answer: Chapter 5 separates rank, clicks and direct navigation with the cascade model; detecting a fifth more willingness to click needs 3,837 impressions per group.
Scope of the numbers: Chapter 2 examines the price evidence: in the illustrative model a repeat-sales estimate is biased upwards by 0.1284, and applying the index's growth of 0.0723 a year leads to systematic under-pruning. Marked boxes separate published evidence, runnable Python calculations (20 programs), classical sources and the author's hypotheses.
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: 3837
| A. impressions per arm, no clustering | |
| u | 0.05: p1 = 0.1051, n = 57,699 |
| u | 0.10: p1 = 0.1101, n = 14,735 |
| u | 0.20: p1 = 0.1201, n = 3,837 |
| u | 0.40: p1 = 0.1401, n = 1,034 |
| B. cities per arm, 2,400 impressions per cell, u | 0.20 |
| ICC 0.000: design effect | 1.00, cells 2 |
| ICC 0.002: design effect | 5.80, cells 10 |
| ICC 0.010: design effect | 24.99, cells 40 |
| ICC 0.050: design effect 120.95, cells | 194 |
Show the full program
# Chapter 5. p53: how many impressions it takes to see a match uplift.
# Test: does a query-matching domain lift click-through at the same
# rank? Compare CTR p0 of non-matching sites with p1 = p0 (1 + u) of
# matching sites at rank 3 (p0 = 0.1001 from p51). Two-sided alpha
# 0.05, power 0.80, normal approximation for two proportions. Clicks
# cluster by city and query, so the design effect 1 + (m - 1) ICC
# inflates the count; m = impressions per city-query cell. Values
# illustrative.
import math
from statistics import NormalDist
Z = NormalDist()
def n_two_props(p0, p1, alpha=0.05, power=0.80):
za = Z.inv_cdf(1 - alpha / 2)
zb = Z.inv_cdf(power)
pb = (p0 + p1) / 2
num = (za * math.sqrt(2 * pb * (1 - pb))
+ zb * math.sqrt(p0 * (1 - p0) + p1 * (1 - p1))) ** 2
return math.ceil(num / (p1 - p0) ** 2)
if __name__ == "__main__":
p0 = 0.1001
print("A. impressions per arm, no clustering")
for u in (0.05, 0.10, 0.20, 0.40):
n = n_two_props(p0, p0 * (1 + u))
print(" u = {:.2f}: p1 = {:.4f}, n = {:>7,}".format(
u, p0 * (1 + u), n))
print("B. cities per arm, 2,400 impressions per cell, u = 0.20")
n = n_two_props(p0, p0 * 1.2)
for icc in (0.0, 0.002, 0.01, 0.05):
deff = 1 + (2400 - 1) * icc
cells = math.ceil(n * deff / 2400)
print(" ICC {:.3f}: design effect {:>6.2f}, cells {:>4}".format(
icc, deff, cells))Single source and citation
Fan, Y. (2026). Real-Options Valuation of Geo-Exact Domain Portfolios, Optimal Renewal Pruning and the Moats of Organic Search (Version 1.0.0), Chapter 5: Rank, Clicks and Direct Navigation: Where the Moat of a Geo-Exact Name Comes From. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-341 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026341,
author = {Fan, Yafu},
title = {Real-Options Valuation of Geo-Exact Domain Portfolios, Optimal Renewal Pruning and the Moats of Organic Search},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Carrying Cost and the Development Option: the Value of Waiting, Renewal Fees and Two Boundaries
- Chapter 2 · The Price Evidence: Repeat-Sales Indices, Survivorship Bias and the Cost of Holding
- Chapter 3 · A Finite-Horizon Lattice: Renewing, Lapsing and Building Year by Year
- Chapter 4 · Pruning under a Budget: the Knapsack, the Greedy Ratio and a Ten-Year Back-Test of Policies
- Chapter 6 · Generative Search and Entity Consistency: Only Structured Data that Visitors Can See
- Chapter 7 · Classics East and West: Bai Gui's "Take What Others Discard" and Henry George on Land Speculation
- Chapter 8 · The Annual Renewal Audit and a Plan for Refutation