The Cambridge Jet algorithm: features and applications

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_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 e+e- annihilation events.

Comments: 16 pages LaTeX2e, 9 .eps-files included Submitted to Eur. Phys. J. C