New and Old Jet Clustering Algorithms for Electron-Positron Events
Stefano Moretti, Leif Lönnblad, Torbjörn Sjöstrand
TL;DR
This paper surveys and compares a wide range of jet clustering algorithms for $e^+e^-$ annihilations, tracing their historical development and assessing their theoretical and experimental performance. By contrasting distance measures, preclustering/reassignment strategies, and coherence with QCD cascades, it highlights how different schemes impact perturbative calculations, particularly the fixed-order and resummed behavior of jet observables such as the three-jet rate and $f_3(y)$. A key finding is that no single algorithm is best in all contexts; algorithms with angular ordering and soft-freezing (e.g., Cambridge, DL, CL) tend to exhibit reduced scale dependence and improved perturbative stability, aiding precise extractions of $\alpha_s$ and robust interpretations of soft-gluon dynamics. The study also clarifies how perturbative sensitivity, hadronization effects, and flavor dependence influence the choice of jet finder for specific analyses.
Abstract
Over the years, many jet clustering algorithms have been proposed for the analysis of hadronic final states in $e^+e^-$ annihilations. These have somewhat different emphasis and are therefore more or less suited for various applications. We here review some of the most used and compare them from a theoretical and experimental point of view.
