Jet analysis by Deterministic Annealing

Physics – High Energy Physics – High Energy Physics - Phenomenology

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

15 pages, 4 figures

Scientific paper

10.1016/S0370-2693(02)02475-9

We perform a comparison of two jet clusterization algorithms. The first one is the standard Durham algorithm and the second one is a global optimization scheme, Deterministic Annealing, often used in clusterization problems, and adapted to the problem of jet identification in particle production by high energy collisions; in particular we study hadronic jets in WW production by high energy electron positron scattering. Our results are as follows. First, we find that the two procedures give basically the same output as far as the particle clusterization is concerned. Second, we find that the increase of CPU time with the particle multiplicity is much faster for the Durham jet clustering algorithm in comparison with Deterministic Annealing. Since this result follows from the higher computational complexity of the Durham scheme, it should not depend on the particular process studied here and might be significant for jet physics at LHC as well.

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

Jet analysis by Deterministic Annealing 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 Jet analysis by Deterministic Annealing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Jet analysis by Deterministic Annealing will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-632578

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