Springer LINK
ForumSpringerThe European Physical Journal C
ForumWhats NewSearchOrdersHelpdeskTable of Contents

The European Physical Journal C

ISSN: 1434-6044 (printed version)
ISSN: 1434-6052 (electronic version)

Table of Contents

Abstract Volume 4 Issue 4 (1998) pp 623-629
DOI 10.1007/s100529800932

experimental physics:
The Cambridge jet algorithm: features and applications

Stan Bentvelsen (1), Irmtraud Meyer (2)

(1) CERN, European Organisation for Particle Physics, CH-1211 Geneva 23, Switzerland
(2) III. Physikalisches Institut, RWTH Aachen, D-52056 Aachen, Germany

Received: 11 March 1998 / Published online: 2 July 1998

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.

Article in PDF-Format (1293 KB)
Article in (gzipped) PS-Format (254 KB)


Online publication: July 20, 1998
LINK Helpdesk
© Springer-Verlag Berlin Heidelberg 1998