The claim
PCC ≤ 2 · LPCC + m + n
where LPCC = number of light preferred (child) edge creations. The name uses "child" only so the acronym lines up 16:15, 16:52.
Setup
Every preferred-edge creation is either a light creation or a heavy creation 16:52. Scenario: v had preferred child u; an access happens somewhere in w's subtree, so uv is destroyed and wv is created 17:41, 18:07.
Case A — wv is light
- Counted directly by the
LPCCterm. Done19:02.
Case B1 — wv is heavy, and v had no preferred child before
Why can v have no preferred child? Either 19:33, 20:05, 20:41:
- this is the first ever access in
v's subtree — happens at mostntimes overall (the+nterm); or - the last access in
v's subtree was tovitself; or - the previous preferred child was cut off. The lecturer then observes that after a
cut,vis anyway the last access in its subtree, so this collapses into the previous case21:30,23:38.
Charging argument 21:49, 22:11, 22:52:
- Hand each access one dollar when it finishes.
- A heavy creation at
vin this case is charged to the last access onv. - Each access is charged at most once: the next time
vis seen it already has a preferred child (namelyw) — unless a new access intervened, and that access absorbs the charge instead23:14,25:56. - With
moperations, this contributes an additive+m27:04.
Case B2 — wv is heavy, and v did have a preferred child u
- Since a vertex has at most one heavy child, and
wvis heavy,uvmust have been light24:37. - So this heavy creation coincides with destroying a preferred light edge. A light preferred edge can only be destroyed once per creation, so charge the destruction to its creation — this is exactly the factor of 2 in front of
LPCC25:29.
flowchart TD
P["Preferred edge creation wv"] --> Q{"wv light or heavy?"}
Q -->|light| L["Counted by LPCC"]
Q -->|heavy| H{"Did v have a<br/>preferred child u?"}
H -->|"no"| N["Charge to last access on v<br/>(or first-ever touch of v's subtree)<br/>⟹ +m and +n"]
H -->|"yes"| Y["u v was light<br/>(≤1 heavy child)<br/>⟹ charge to its creation<br/>⟹ factor 2 on LPCC"]