关于「最大路口的陷阱:总人流、目标客层密度与停留时间」,《快闪店选址的引力、稀释与租金》给出的定量结论是什么?
结论:第一章用三种街型说明,路人是巷弄 4.00 倍的大路口,日毛利只有巷弄的 0.212,并引用服装连锁的门店研究:销售对人流报酬递减,转化率随人流下降。
数据口径:书中的街道、铺位、人流、租金与成本均为示意;全部计算由书中程序生成;本书是非个人化经营建议,不构成法律或理财建议,租约条款以上架前人工复核为准。 书中以标注框区分已发表的证据、可运行的 Python 计算(20 段程序)、原典与作者的假说,并附快闪选址打分器一件。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.212, 4.00
| site passers target entries buyers conv per1000 margin/day | |
| CROSS | 24000 1440 286.0 36.3 0.127 1.51 13591 |
| ATRIUM | 15000 2250 435.2 111.0 0.255 7.40 41505 |
| LANE | 6000 2100 421.8 171.7 0.407 28.61 64204 |
| traffic ratio CROSS/LANE | 4.00 |
| margin ratio CROSS/LANE | 0.212 |
| target x seconds x minutes: | |
| CROSS density-dwell index | 36.0 |
| ATRIUM density-dwell index | 162.0 |
| LANE density-dwell index | 323.4 |
查看完整验算程序
# Chapter 1. p11: three sites, total traffic versus target density x dwell
# Funnel: daily gross margin = N * [s * e_t + (1 - s) * e_o] * b * B * m
# N passers per day, s share of the target segment among them
# e_t = 1 - exp(-H_E * w) entry chance of a target passer who
# has the window in view for w seconds
# e_o = 1 - exp(-K_O * H_E * w) entry chance of an off-target passer
# b = 1 - exp(-H_B * T) purchase chance after T minutes inside
# B basket (currency units), m gross margin rate. Off-target entrants buy
# with hazard K_B * H_B. Every parameter is illustrative: the sites
# are composites, not measurements of any real street.
import math
H_E = 0.012 # entry hazard per second of window view, target passer
K_O = 0.15 # off-target passers enter at this fraction of the hazard
H_B = 0.06 # purchase hazard per minute inside, target entrant
K_B = 0.25 # off-target entrants buy at this fraction of the hazard
BASKET = 680.0
MARGIN = 0.55
# name, passers/day, target share, window seconds, minutes inside
SITES = [("CROSS", 24000, 0.06, 5.0, 5.0),
("ATRIUM", 15000, 0.15, 9.0, 8.0),
("LANE", 6000, 0.35, 14.0, 11.0)]
def funnel(n, s, w, t):
e_t = 1.0 - math.exp(-H_E * w)
e_o = 1.0 - math.exp(-K_O * H_E * w)
b_t = 1.0 - math.exp(-H_B * t)
b_o = 1.0 - math.exp(-K_B * H_B * t)
ent_t, ent_o = n * s * e_t, n * (1.0 - s) * e_o
buy = math.fsum([ent_t * b_t, ent_o * b_o])
ent = math.fsum([ent_t, ent_o])
return ent, buy, buy * BASKET * MARGIN
print("site passers target entries buyers conv per1000 margin/day")
res = {}
for name, n, s, w, t in SITES:
ent, buy, gm = funnel(n, s, w, t)
res[name] = (n, ent, buy, gm)
print("{:<7}{:>8}{:>8.0f}{:>9.1f}{:>8.1f}{:>7.3f}{:>9.2f}{:>12.0f}"
.format(name, n, n * s, ent, buy, buy / ent,
1000.0 * buy / n, gm))
c, l = res["CROSS"], res["LANE"]
print("traffic ratio CROSS/LANE {:.2f}".format(c[0] / l[0]))
print("margin ratio CROSS/LANE {:.3f}".format(c[3] / l[3]))
print("target x seconds x minutes:")
for name, n, s, w, t in SITES:
print(" {:<7} density-dwell index {:>7.1f}".format(name,
n * s * w * t / 1000.0))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《快闪店赫夫引力选址、步行客流泊松稀释与中心地等级租金梯度母典》第 1 章「最大路口的陷阱:总人流、目标客层密度与停留时间」(版本 1.0.0). 5D Library. DOI 待发布
DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-214 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026214,
author = {Fan, Yafu},
title = {Huff Gravity Siting for Pop-Up Stores, Poisson Thinning of Foot Traffic and Central-Place Rent Gradients},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}