JET: A Global Jet Finding Algorithm
Abstract
We introduce a new jet-finding algorithm for a hadron collider based on maximizing a JET function for all possible combinations of particles in an event. This function prefers a larger value of the jet transverse energy and a smaller value of the jet mass. The jet shape is proved to be a circular cone in Cartesian coordinates with the geometric center shifted from the jet momentum toward the central region. The jet cone size shrinks for a more forward jet. We have implemented our JET algorithm with a reasonable running time scaling as N n3, where "N" is the total number of particles and "n" (much less than N) is the number of particles in a fiducial region. Many features of our JET jets are similar to anti-kt jets, including the reconstructed jet momentum and the "back-reaction" from soft contamination. Nevertheless, when the jet parameters in the two algorithms are matched using QCD jets, we find that the JET algorithm has a larger efficiency than anti-kt for identifying objects with hard splittings such as a W-jet.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.