Related papers: The SISCone jet algorithm optimised for low partic…
Current cone jet algorithms, widely used at hadron colliders, take event particles as seeds in an iterative search for stable cones. A longstanding infrared (IR) unsafety issue in such algorithms is often assumed to be solvable by adding…
We illustrate how the midpoint and iterative cone (with progressive removal) algorithms fail to satisfy the fundamental requirements of infrared and collinear safety, causing divergences in the perturbative expansion. We introduce SISCone…
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,…
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 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…
This writeup highlights the infrared unsafety of the "midpoint" cone jet-algorithm and provides a brief overview of why this is a serious issue. It then shows how one can build a safe (seedless) cone algorithm and discusses the potential…
The k_t and Cambridge/Aachen inclusive jet finding algorithms for hadron-hadron collisions can be seen as belonging to a broader class of sequential recombination jet algorithms, parametrised by the power of the energy scale in the distance…
We introduce a new jet clustering algorithm named SIFT (Scale-Invariant Filtered Tree) that maintains the resolution of substructure for collimated decay products at large boosts. The scale-invariant measure combines properties of kT and…
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…
Recently, numerous meta-heuristic based approaches are deliberated to reduce the computational complexities of several existing approaches that include tricky derivations, very large memory space requirement, initial value sensitivity etc.…
Standard jet finding techniques used in elementary particle collisions have not been successful in the high track density of heavy-ion collisions. This paper describes a modified cone-type jet finding algorithm developed for the complex…
Jet clustering is traditionally an unsupervised learning task because there is no unique way to associate hadronic final states with the quark and gluon degrees of freedom that generated them. However, for uncolored particles like $W$, $Z$,…
We introduce a new jet algorithm called XCone, for eXclusive Cone, which is based on minimizing the event shape N-jettiness. Because N-jettiness partitions every event into N jet regions and a beam region, XCone is an exclusive jet…
In the present contribution we introduce a strategy to quantify the performance of modern infrared and collinear safe jet clustering algorithms in processes which involve the reconstruction of heavy object decays. We determine optimal…
A C++ implementation of the Kt jet algorithm for high energy particle collisions is presented. The time performance of this implementation is comparable to the widely used Fortran implementation. Identical algorithmic functionality is…
This article gives results on several jet algorithms in electron-positron annihilation: Considered are the exclusive sequential recombination algorithms Durham, Geneva, Jade-E0 and Cambridge, which are typically used in electron-positron…
We propose a new jet algorithm for deep-inelastic scattering (DIS) that accounts for the forward-backward asymmetry in the Breit frame. The Centauro algorithm is longitudinally invariant and can cluster jets with Born kinematics, which…
Identifying jets formed in high-energy particle collisions requires solving optimization problems over potentially large numbers of final-state particles. In this work, we consider the possibility of using quantum computers to speed up jet…
Jet clustering algorithms are widely used to analyse hadronic events in high energy collisions. Recently a new clustering method, known as `Cambridge', has been introduced. In this article we present an algorithm to determine the transition…
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…