The anti-kt jet clustering algorithm
The anti-kt jet clustering algorithm
复制标题
DOI：
10.1088/1126-6708/2008/04/063
复制
发表时间：
2008-04-01
影响因子：
5.4
通讯作者：
Soyez, Gregory
中科院分区：
文献类型：
--
作者：
Cacciari, Matteo;Salam, Gavin P.;Soyez, Gregory
用于强子碰撞的k(T)和Cambridge/Aachen包含喷注算法可以被视为属于更广泛类别的顺序复合喷注算法，该算法由距离度量中的能量尺度的幂来参数化。我们研究了这个类的一个新成员的一些性质，对它的幂是负的。这种“反k(T)”算法本质上类似于一种理想化的锥形算法，因为只有软破碎的射流是圆锥形的，主动和被动面积相等，面积反常维度为零，非全局对数是刚性边界的对数，米兰因子是通用的。这些性质都不适用于现有的顺序重组算法，也不适用于具有拆分-合并步骤的锥形算法，如SISCone。然而，它们是共线不安全的平面迭代圆锥算法的识别特征，对于该算法，反k(T)算法提供了一种自然、快速、红外和共线安全的替代算法。
The k(t) and Cambridge/Aachen inclusive jet finding algorithms for hadronhadron 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.