2002/07/02 by L. Angelini, L Angelini, P. De Felice +11 · 1 citation
Physics and Astronomy · #High-Energy Particle Collisions Research #Particle Detector Development and Performance #Particle physics theoretical and experimental studies #hep-ph
paper · pdf · doi:10.1016/s0370-2693(02)02475-9
published as Phys.Lett. B545 (2002) 315-322 · 15 pages, 4 figures
arxiv created 2002/07/02 · openalex publication_date 2002/10/01 · arxiv updated 2009/11/30 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28
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.