Related papers: The SISCone and anti-kt jet algorithms
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…
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 SISCone jet algorithm is a seedless infrared-safe cone jet algorithm. There exists an implementation which is highly optimised for a large number of final state particles. However, in fixed-order perturbative calculations with a small…
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…
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 compare the abilities of the cluster-type jet algorithm, KtJet, and a mid-point iterating cone algorithm to reconstruct the top mass at the LHC. We discuss the information contained in the merging scales of cluster-type algorithms, and…
In this work, we describe how infrared-collinear safety can be restored perturbatively for standard definitions of jets and jet flavour. We will explicitly study this approach at next-to-next-to-leading order in QCD, where we will discuss…
In this note we aim at putting more emphasis on the fact that trying to solve non-convex optimization problems with coordinate-descent iterative linear matrix inequality algorithms leads to suboptimal solutions, and put forward other…
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…
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…
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…
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…
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…
Though it is widely taken for granted that it makes sense to separately discuss quark and gluon jets, normal jet algorithms lead to a net parton-level jet flavour that is infrared (IR) unsafe. This writeup illustrates the problem and…
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 analyze the effects of jet algorithms on each factorized part of the dijet cross sections in $e^+ e^-$ scattering using the soft-collinear effective theory. The jet function and the soft function with a cone-type jet algorithm and the…
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…
We determine the jet vertex for Mueller-Navelet jets and forward jets in the small-cone approximation for two particular choices of jet algoritms: the kt algorithm and the cone algorithm. These choices are motivated by the extensive use of…
We show how the recently proposed XCone jet algorithm smoothly interpolates between resolved and boosted kinematics. When using standard jet algorithms to reconstruct the decays of hadronic resonances like top quarks and Higgs bosons, one…
The factorization theorem for the dijet cross section is presented in hadron-hadron collisions with a cone-type jet algorithm. We also apply the beam veto to the beam jets consisting of the initial radiation. The soft-collinear effective…