Optimal Jet Finder

Abstract

We describe a FORTRAN 77 implementation of the optimal jet definition for identification of jets in hadronic final states of particle collisions. We discuss details of the implementation, explain interface subroutines and provide a usage example. The source code is available from http://www.inr.ac.ru/~ftkachov/projects/jets/. Program summary Title of program: Optimal Jet Finder (OJF_014) Catalogue identifier: ADSB Program Summary URL: http://cpc.cs.qub.ac.uk/summaries/ADSB Program obtainable from: CPC Program Library, Queen's University of Belfast, N. Ireland Computer: Any computer with the FORTRAN 77 compiler Tested with: g77/Linux on Intel, Alpha and Sparc; Sun f77/Solaris (thwgs.cern.ch); xlf/AIX (rsplus.cern.ch); MS Fortran PowerStation 4.0/Win98 Programming language used: FORTRAN 77 Memory required: ∼1 MB (or more, depending on the settings) Number of bytes in distributed program, including examples and test data: 251 463 Distribution format: tar gzip file Keywords: Hadronic jets, jet finding algorithms Nature of physical problem: Analysis of hadronic final states in high energy particle collision experiments often involves identification of hadronic jets. A large number of hadrons detected in the calorimeter is reduced to a few jets by means of a jet finding algorithm. The jets are used in further analysis which would be difficult or impossible when applied directly to the hadrons. Grigoriev et al. [ hep-ph/0301185] provide a brief introduction to the subject of jet finding algorithms and a general review of the physics of jets can be found in [Rep. Prog. Phys. 36 (1993) 1067]. Method of solution: The software we provide is an implementation of the so-called optimal jet definition ( OJD). The theory of OJD was developed by Tkachov [Phys. Rev. Lett. 73 (1994) 2405; 74 (1995) 2618; Int. J. Mod. Phys. A 12 (1997) 5411; 17 (2002) 2783]. The desired jet configuration is obtained as the one that minimizes Ω R , a certain function of the input particles and jet configuration. Restrictions on the complexity of the program: The size of the largest data structure the program uses is (maximal number of particles in the input) × (maximal number of jets in the output) × 8 bytes. (For the standard settings <1 MB). Therefore, there is no memory restriction for any conceivable application for which the program was designed. Typical running time: The running time depends strongly on the physical process being analyzed and the parameters used. For the benchmark process we studied, e + e −→ W + W −→ 4 jets , with the average number of ∼80 particles in the input, the running time was <10 −2 s on a modest PC (per event with n tries=1). For a fixed number of jets the complexity of the algorithm grows linearly with the number of particles (cells) in the input, in contrast with other known jet finding algorithms for which this dependence is cubic. The reader is referred to Grigoriev et al. [ hep-ph/0301185] for a more detailed discussion of this issue.