Theorem 4.8, p. 22 — with probability ≥ 1 − 𝒩_{δ/8}(𝔽^{cδ})e^{−n¾cδ𝒱_{δ/8}(𝔽^{cδ})} the algorithm outputs as many clusters as f has peaks of prominence ≥ d₂

Initializing...

Theorem 4.8, p. 22 — with probability ≥ 1 − 𝒩_{δ/8}(𝔽^{cδ})e^{−n¾cδ𝒱_{δ/8}(𝔽^{cδ})} the algorithm outputs as many clusters as f has peaks of prominence ≥ d₂ · Prove2Me