Skip to main content

Advertisement

Log in

The Cambridge jet algorithm: features and applications

  • Experimental physics
  • Published:
The European Physical Journal C - Particles and Fields Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

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

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s100520050232

Keywords

Navigation