Related papers: The anti-k_t jet clustering algorithm
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…
Using the dispersive method we perform a two-loop analysis of the leading non-perturbative power correction to the change in jet transverse momentum $p_T$, in the small $R$ limit of a Cambridge-Aachen jet clustering algorithm. We frame the…
We propose extensions of the anti-$k_t$ and Cambridge/Aachen hierarchical jet clustering algorithms that are designed to retain the exact jet kinematics of these algorithms, while providing an infrared-and-collinear-safe definition of jet…
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…
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…
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…
We present a new method to expose the dead cone effect at colliders using iterative declustering techniques. Iterative declustering allows to unwind the jet clustering and to access the subjets or branches at different depths of the jet…
At high-energy colliders, jets of hadrons are the observable counterparts of the perturbative concepts of quarks and gluons. Good procedures for identifying jets are central to experimental analyses and comparisons with theory. The Kt…
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…
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…
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…
Most recombination-style jet algorithms cluster soft gluons in a complex way. This leads to correlations in the soft gluon phase space and introduces logarithmic corrections to jet cross sections. The leading Abelian clustering logarithms…
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…
This talk reviews some key developments that have taken place in hadron-collider jet finding over the past couple of years, including: technical advances such as the complete formulation of an infrared safe seedless cone algorithm and fast…
We examine the problem of jet reconstruction at heavy-ion colliders using jet-area-based background subtraction tools as provided by FastJet. We use Monte Carlo simulations with and without quenching to study the performance of several jet…
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.…
Measurements of the inclusive jet cross section with the anti-kt clustering algorithm are presented for two radius parameters, R=0.5 and 0.7. They are based on data from LHC proton-proton collisions at sqrt(s) = 7 TeV corresponding to an…
We compute the fixed-order distribution of the non-global hemisphere mass observable in $e^+ e^-$ annihilation up to four loops for various sequential recombination jet algorithms. In particular, we focus on the $k_t$ and Cambridge/Aachen…
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 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…