Dispelling the N3 myth for the kt jet-finder

By Matteo Cacciari, G. Salam. 2005

1,634 citations recorded by the source corpus.

Abstract At high-energy colliders, jets of hadrons are the observable counterparts of the perturbative concepts of quarks and gluons. Good procedures for identifying jets are central to experimental analyses and comparisons with theory. The k t family of successive recombination jet finders has been widely advocated because of its conceptual simplicity and flexibility and its unique ability to approximately reconstruct the partonic branching sequence in an event. Until now however, it had been believed that for an ensemble of N particles the algorithmic complexity of the k t jet finder scaled as N 3 , a severe issue in the high multiplicity environments of LHC and heavy-ion colliders. We here show that the computationally complex part of k t jet-clustering can be reduced to two-dimensional nearest neighbour location for a dynamic set of points. Borrowing techniques developed for this extensively studied problem in computational geometry, k t jet-finding can then be performed in N ln N time. Code based on these ideas is found to run faster than all other jet finders in current use.

Subfields: Artificial Intelligence, Computer Graphics and Computer-Aided Design, Nuclear and High Energy Physics

View Paper: https://www.semanticscholar.org/paper/929dab16b1e5def07427b4deefa00dd900be5c77

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Cms Collaboration
  2. Atlas Collaboration
  3. G. Soyez
  4. Gudrun Heinrich
  5. Jesse Thaler
  6. A. Larkoski
  7. G. Salam
  8. P. Nason

In Computer Graphics and Computer-Aided Design

  1. Cms Collaboration
  2. Atlas Collaboration
  3. E. Re
  4. P. Nason
  5. Carlo Oleari
  6. G. Soyez
  7. Simone Alioli
  8. L. Lonnblad

In Nuclear and High Energy Physics

  1. Cms Collaboration
  2. Atlas Collaboration
  3. Gudrun Heinrich
  4. A. Larkoski
  5. M. Schönherr
  6. Fabio Maltoni
  7. F. Krauss
  8. S. Höche

Citations in the corpus