Dispelling the N^3 myth for the Kt jet-finder

Physics – High Energy Physics – High Energy Physics - Phenomenology

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

11 pages, 3 figures; v2, to appear in Phys.Lett.B, includes an extra section briefly discussing the issues of jet areas and pi

Scientific paper

10.1016/j.physletb.2006.08.037

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 Kt 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 Kt 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 Kt 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, Kt 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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Dispelling the N^3 myth for the Kt jet-finder does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Dispelling the N^3 myth for the Kt jet-finder, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dispelling the N^3 myth for the Kt jet-finder will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-112203

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.