The Cambridge Jet algorithm: features and applications
Stan Bentvelsen, Irmtraud Meyer
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 ycut 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.
Create a lesson
Related papers
The LZ inelastic splitting as a probe of anomaly mediation
Seung J. Lee, Taewook Youn
Precision Tokenization for Multi-Modal Data in High Energy Physics
Jeffrey Krupa, Samuel Klein, Nilotpal Kakati et al.
Complete four-loop pressure of cold QED
Aapeli Kärkkäinen, Pablo Navarrete, Mika Nurmela et al.
Long-Distance Contributions to Light Vector Mesons and Radiative Decays of ηc
Xiao-Yu Qi, Qi Wu, Dian-Yong Chen
Utilizing Neural Networks for Solving Functional Renormalization Group Flow Equations
J. Gurzó, G. Fejős
ALP interactions with mesons and baryons at O(1/fa): a general field redefinition invariant approach
Jorge Alda, Stefano Rigolin