Abstract.
Jet clustering algorithms are widely used to analyse hadronic events in high energy collisions. Recently a new clustering method, known as ‘Cambridge’, has been introduced. In this article we present an algorithm to determine the transition values of \(y_{\mathrm{cut}}\) for this clustering scheme, which allows to resolve any event to a definite number of jets in the final state. We discuss some particularities of the Cambridge clustering method and compare its performance to the Durham clustering scheme for Monte Carlo generated \(\mathrm{e^+e^-}\) annihilation events.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 11 March 1998 / Published online: 2 July 1998
Rights and permissions
About this article
Cite this article
Bentvelsen, S., Meyer, I. The Cambridge jet algorithm: features and applications. Eur. Phys. J. C 4, 623–629 (1998). https://doi.org/10.1007/s100520050232
Issue Date:
DOI: https://doi.org/10.1007/s100520050232