FastJet: a code for fast kt clustering, and more
Matteo Cacciari
Abstract
Two main classes of jet clustering algorithms, cone and kt, are briefly discussed. It is argued that the former can be often cumbersome to define and implement, and difficult to analyze in terms of its behaviour with respect to soft and collinear emissions. The latter, on the other hand, enjoys a very simple definition, and can be easily shown to be infrared and collinear safe. Its single potential shortcoming, a computational complexity believed to scale like the number of particles to the cube (N3), is overcome by introducing a new geometrical algorithm that reduces it to N ln N. A practical implementation of this approach to kt-clustering, FastJet, is shown to be orders of magnitude faster than all other present codes, opening the way to the use of kt-clustering even in highly populated heavy ion events.
Create a lesson
Related papers
First-principle predictions of fragmentation functions via quantum computing
Juan J. Gálvez-Viruet, Felipe J. Llanes-Estrada, Nicolas M. Arenaza et al.
High energy thermal photons from chirally imbalanced QGP
Sourav Duari, Nilanjan Chaudhuri, Pradip Roy et al.
Spin-dependent fermion potentials from mixed tensor couplings of massive spin-1 and spin-2 bosons
D. Khadka, V. V. Flambaum
Building a Better Beta: Nucleation and Timescales in Cosmological Phase Transitions
William Searle, Csaba Balázs
Quantum Steering Geometry at High Energy Particle Colliders
Juan J. Mejia Alvarez, Andrew J. Wildridge, Angelo Arisi et al.
Quantum-statistical effects of bosonic warm dark matter in microscopic interacting dark sectors
Zhijian Zhang