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 in events generated at hadronic colliders. Deterministic annealing is able to reproduce the results obtained by traditional jet algorithms and to exhibit a higher degree of flexibility.
Deterministic Annealing as a jet clustering algorithm in hadronic collisions
ANGELINI, Leonardo;STRAMAGLIA, Sebastiano
2004-01-01
Abstract
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 in events generated at hadronic colliders. Deterministic annealing is able to reproduce the results obtained by traditional jet algorithms and to exhibit a higher degree of flexibility.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.