The anti-\(k_t\) jet clustering algorithm
From MaRDI portal
Publication:2400189
DOI10.1088/1126-6708/2008/04/063zbMATH Open1369.81100arXiv0802.1189OpenAlexW3121614399WikidataQ42302345 ScholiaQ42302345MaRDI QIDQ2400189
Author name not available (Why is that?)
Publication date: 28 August 2017
Published in: (Search for Journal in Brave)
Abstract: 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 measure. We examine some properties of a new member of this class, for which the power is negative. This ``anti-k_t algorithm essentially behaves like an idealised cone algorithm, in that jets with only soft fragmentation are conical, active and passive areas are equal, the area anomalous dimensions are zero, the non-global logarithms are those of a rigid boundary and the Milan factor is universal. None of these properties hold for existing sequential recombination algorithms, nor for cone algorithms with split--merge steps, such as SISCone. They are however the identifying characteristics of the collinear unsafe plain ``iterative cone algorithm, for which the anti-k_t algorithm provides a natural, fast, infrared and collinear safe replacement.
Full work available at URL: https://arxiv.org/abs/0802.1189
No records found.
This page was built for publication: The anti-\(k_t\) jet clustering algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2400189)
