Related papers: The Georgi Algorithms of Jet Clustering
Clustering algorithms build jets though the iterative application of single particle and pairwise metrics. This leads to phase space constraints that are extremely complicated beyond the lowest orders in perturbation theory, and in practice…
Two main classes of jet clustering algorithms, cone and k_t, are briefly discussed. It is argued that the former can be often cumbersome to define and implement, and difficult to analyze in terms of its behaviour with respect to soft and…
Jet grooming algorithms are widely used in experimental analyses at hadron colliders to remove contaminating radiation from within jets. While the algorithms perform a great service to the experiments, their intricate algorithmic structure…
Jets are an important probe to identify the hard interaction of interest at the LHC. They are routinely used in Standard Model precision measurements as well as in searches for new heavy particles, including jet substructure methods. In…
Jets are algorithmic proxies of hard scattered partons, i.e. quarks and gluons, in high energy particle collisions. The STAR collaboration presents the first measurements of substructure observables at the first, second and third splits in…
Under which conditions does a jet appear as a particle--like signal from the hidden realm of quarks and gluons? Motivated by this question jet clustering conditions are formulated, in order to characterize jet clustering algorithms, which…
Studies on jet substructure have evolved significantly in recent years. Jet substructure is essentially determined by QCD radiations and non-perturbative effects. Predictions of jet substructure are usually different among Monte Carlo event…
We reframe common tasks in jet physics in probabilistic terms, including jet reconstruction, Monte Carlo tuning, matrix element - parton shower matching for large jet multiplicity, and efficient event generation of jets in complex,…
Collimated streams of particles produced in high energy physics experiments are organized using clustering algorithms to form jets. To construct jets, the experimental collaborations based at the Large Hadron Collider (LHC) primarily use…
Conventional jet algorithms are based on a deterministic view of the underlying hard scattering process. Each outgoing parton from the hard scattering is associated with a hard, well separated jet. This approach is very successful because…
We investigate modifications to the $k_\perp$-clustering jet algorithm which preserve the advantages of the original Durham algorithm while reducing non-perturbative corrections and providing better resolution of jet substructure. We find…
Clustering is one of the most frequent problems in many domains, in particular, in particle physics where jet reconstruction is central in experimental analyses. Jet clustering at the CERN's Large Hadron Collider (LHC) is computationally…
Explicit applications of factorization theorems for processes at hadron colliders near the hadronic endpoint have largely focused on simple final states with either no jets (e.g., Drell-Yan) or one inclusive jet (e.g., deep inelastic…
Jet finding is a type of optimization problem, where hadrons from a high-energy collision event are grouped into jets based on a clustering criterion. As three interesting examples, one can form a jet cluster that (1) optimizes the overall…
We introduce a new jet-finding algorithm for a hadron collider based on maximizing a J_{E_T} function for all possible combinations of particles in an event. This function prefers a larger value of the jet transverse energy and a smaller…
Many experimental analyses separate events into exclusive jet bins, using a jet algorithm to cluster the final state and then veto on jets. Jet clustering induces logarithmic dependence on the jet radius R in the cross section for exclusive…
I describe a class of iterative jet algorithms that are based on maximizing a fixed function of the total 4-momentum rather than clustering of pairs of jets. I describe some of the properties of the simplest examples of this class,…
Recent developments in jet clustering are reviewed. We present a list of fast and infrared and collinear safe algorithms, and also describe new tools like jet areas. We show how these techniques can be applied to the study of underlying…
A new class of jet clustering algorithms is introduced. A criterion inspired by successful mass-drop taggers is applied that prevents the recombination of two hard prongs if their combined jet mass is substantially larger than the masses of…
Clustering logs have been the subject of much study in recent literature. They are a class of large logs which arise for non-global jet-shape observables where final-state particles are clustered by a non-cone--like jet algorithm. Their…