Related papers: A Simple Alternative to Jet-Clustering Algorithms
We study the case where quantum computing could improve jet clustering by considering two new quantum algorithms that might speed up classical jet clustering algorithms. The first one is a quantum subroutine to compute a Minkowski-based…
The study of standard QCD jets produced along with fat jets, which may appear as a result of the decay of a heavy particle, has become an essential part of collider studies. Current jet clustering algorithms, which use a fixed radius…
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…
We extend the work of [1] to the case in which final-state jets, produced in association with a Higgs or vector boson, are defined using the $k_t$ algorithm. We thereby compute the full distribution of the invariant mass squared of the…
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 jet algorithm must specify how to (re-)combine different partons or towers into a single four-vector. Various recombination schemes have been used experimentally to examine the transverse energy profile of jets in hadron colliders.…
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…
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…
A systematic framework for jet definition is developed from first principles of physical measurement, quantum field theory, and QCD. A jet definition is found which: is theoretically optimal in regard of both minimization of detector errors…
We study the factorization of the dijet cross section in $e^+ e^-$ annihilation using the generalized exclusive jet algorithm which includes the cone-type, the JADE, the $k_T$, the anti-$k_T$ and the Cambridge/Aachen jet algorithms as…
Jets constructed via clustering algorithms (e.g., anti-$k_T$, soft-drop) have been proposed for many precision measurements, such as the strong coupling $\alpha_s$ and the nucleon intrinsic dynamics. However, the theoretical accuracy is…
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…
Clustering is often used for discovering structure in data. Clustering systems differ in the objective function used to evaluate clustering quality and the control strategy used to search the space of clusterings. Ideally, the search…
We present a new approach to jet definition alternative to clustering methods, such as the anti-$k_T$ scheme, that exploit kinematic data directly. Instead the new method uses kinematic information to represent the particles in a…
As a kind of basic machine learning method, clustering algorithms group data points into different categories based on their similarity or distribution. We present a clustering algorithm by finding hyper-planes to distinguish the data…
I provide a very brief overview of recent developments in jet algorithms, mostly focusing on the issue of infrared-safety.
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…
Machine learning has become an essential tool in jet physics. Due to their complex, high-dimensional nature, jets can be explored holistically by neural networks in ways that are not possible manually. However, innovations in all areas of…
We show that a general purpose clusterization algorithm, Deterministic Annealing, can be adapted to the problem of jet identification in particle production by high energy collisions. In particular we consider the problem of jet searching…
We define jet transition values for the anti-$k_{\bot}$ algorithm for both hadron and $e^+e^-$ colliders. We show how these transition values can be computed and how they can be used to improve the performance of clusterization when jet…