FastJet: a code for fast k_t clustering, and more

Physics – High Energy Physics – High Energy Physics - Phenomenology

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

4 pages, talk given at Moriond QCD (La Thuile, Italy), March 2006, and DIS2006 (Tsukuba, Japan), April 2006

Scientific paper

Two main classes of jet clustering algorithms, cone and k_t, 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 (N^3), is overcome by introducing a new geometrical algorithm that reduces it to N ln N. A practical implementation of this approach to k_t-clustering, FastJet, is shown to be orders of magnitude faster than all other present codes, opening the way to the use of k_t-clustering even in highly populated heavy ion events.

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

FastJet: a code for fast k_t clustering, and more 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 FastJet: a code for fast k_t clustering, and more, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and FastJet: a code for fast k_t clustering, and more will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-96546

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