Jet analysis by deterministic annealing

DOI10.1016/S0370-2693(02)02475-9zbMATH Open0998.81540arXivhep-ph/0207032OpenAlexW3102345499MaRDI QIDQ699189FDOQ699189

Authors: P. de Felice, G. Nardulli, L. Nitti, L. Angelini, Mario Alessandro Maggi, M. Pellicoro, S. Stramaglia 

Publication date: 6 October 2002

Published in: Physics Letters B (Search for Journal in Brave)

Abstract: 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.

Full work available at URL: https://arxiv.org/abs/hep-ph/0207032

Recommendations

• Parallel \(k_t\) jet clustering algorithm
• Hierarchical \(\mathsf{k}_{\mathsf{t}}\) jet clustering for parallel architectures
• The anti-\(k_t\) jet clustering algorithm
• Jet reconstruction of individual orbits in many-particle problems
• FastJet user manual (for version 3.0.2)

zbMATH Keywords

Durham algorithmglobal optimization schemejet clustering algorithms

Mathematics Subject Classification ID

Strong interaction, including quantum chromodynamics (81V05)

Cites Work

• A deterministic annealing approach to clustering
• Equation of State Calculations by Fast Computing Machines
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm

Cited In (4)

• Jet reconstruction of individual orbits in many-particle problems
• Clustering algorithm using space filling curves for the classification of high energy physics data
• Quarks and gluons in the Lund plane
• Automated feature selection procedure for particle jet classification

This page was built for publication: Jet analysis by deterministic annealing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q699189)