Related papers: New and Old Jet Clustering Algorithms for Electron…
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…
Many jet algorithms have been proposed in the past to study the hadronic final state in E+E-, EP and PP collisions. Here we review some of the most popular, mainly concentrating on the jet algorithms used at HERA and TEVATRON.
Jet finding algorithms, as they are used in $e^+ e^-$ and hadron collisions, are reviewed and compared. It is suggested that a successive combination style algorithm, similar to that used in $e^+ e^-$ physics, might be useful also in hadron…
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…
We assess the performance of different jet-clustering algorithms, in the presence of different resolution parameters and reconstruction procedures, in resolving fully hadronic final states emerging from the chain decay of the discovered…
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 investigate a modification of the $k_\perp$-clustering jet algorithm for hadron-hadron collisions, analogous to the ``Cambridge'' algorithm recently proposed for $e^+e^-$ annihilation, in which pairs of objects that are close in angle…
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…
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,…
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 jet algorithm based on the k-means clustering procedure is proposed which can be used for the invariant-mass reconstruction of heavy states decaying to hadronic jets. The proposed algorithm was tested by reconstructing E+ E- to ttbar to 6…
Experimental High-Energy Physics (HEP), especially the Large Hadron Collider (LHC) programme at the European Organization for Nuclear Research (CERN), is one of the most computationally intensive activities in the world. This demand is set…
We review recent developments related to jet clustering algorithms and jet finding. These include fast implementations of sequential recombination algorithms, new IRC safe algorithms, quantitative determination of jet areas and quality…
Quantum computing holds the promise of substantially speeding up computationally expensive tasks, such as solving optimization problems over a large number of elements. In high-energy collider physics, quantum-assisted algorithms might…
We study the possibility to employ neural networks to simulate jet clustering procedures in high energy hadron-hadron collisions. We concentrate our analysis on the Fermilab Tevatron energy and on the $k_\bot$ algorithm. We consider both…
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…
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 calculate the rate for $e^+e^-$ annihilation into four jets at next-to-leading order in perturbative QCD, but omitting terms that are suppressed by one or more powers of $1/\Nc^2$, where $\Nc$ is the number of colors. The…
A method is suggested to combine tree level QCD matrix for the production of multi jet final states and the parton shower in hadronic interactions. The method follows closely an algorithm developed recently for the case of $e^+e^-$…
We study electron-positron annihilations into six jets at the parton level in perturbative Quantum Chromo-Dynamics. We use helicity amplitude methods. Results are presented for the case of the Durham and Cambridge jet clustering algorithms…