Deterministic Annealing as a jet clustering algorithm in hadronic collisions

Abstract

We show that a general purpose clusterization algorithm, Deterministic Annealing, can be adapted to the problem of jet identification in particle production by high energy collisions. In particular we consider the problem of jet searching in events generated at hadronic colliders. Deterministic Annealing is able to reproduce the results obtained by traditional jet algorithms and to exhibit a higher degree of flexibility.

13 pages, 6 figures

References in corpus (6)

• Better Jet Clustering Algorithms
• PYTHIA 6.3 Physics and Manual
• New and Old Jet Clustering Algorithms for Electron-Positron Events
• The Cambridge Jet algorithm: features and applications
• Jet analysis by Deterministic Annealing
• Report of the QCD Working Group

Cited by in corpus (8)

• Dispelling the N^3 myth for the Kt jet-finder
• Towards Jetography
• Maximizing Boosted Top Identification by Minimizing N-subjettiness
• Jet Observables Without Jet Algorithms
• Recursive Neural Networks in Quark/Gluon Tagging
• Quantum Algorithms for Jet Clustering
• XCone: N-jettiness as an Exclusive Cone Jet Algorithm
• Separated at Birth: Jet Maximization, Axis Minimization, and Stable Cone Finding