The Cambridge Jet Algorithm: features and applications

Jet clustering algorithms are widely used to analyse hadronic events in high energy collisions. Recently a new clustering method, known as `Cambridge', has been introduced. In this article we present an algorithm to determine the transition values of ycut for this clustering scheme, which allow...

Descripción completa

Detalles Bibliográficos
Autores principales: Bentvelsen, Stan, Meyer, Irmtraud
Lenguaje:eng
Publicado: 1998
Materias:
Detectors and Experimental Techniques
Acceso en línea:https://dx.doi.org/10.1007/s100520050232
http://cds.cern.ch/record/376761
_version_ 1780893275011416064
author Bentvelsen, Stan
Meyer, Irmtraud
author_facet Bentvelsen, Stan
Meyer, Irmtraud
author_sort Bentvelsen, Stan
collection CERN
description Jet clustering algorithms are widely used to analyse hadronic events in high energy collisions. Recently a new clustering method, known as `Cambridge', has been introduced. In this article we present an algorithm to determine the transition values of ycut for this clustering scheme, which allows to resolve any event to a definite number of jets in the final state. We discuss some particularities of the Cambridge clustering method and compare its performance to the Durham clustering scheme for Monte Carlo generated e+e- annihilation events.
id cern-376761
institution Organización Europea para la Investigación Nuclear
language eng
publishDate 1998
record_format invenio
spelling cern-3767612023-04-20T02:30:44Zdoi:10.1007/s100520050232http://cds.cern.ch/record/376761engBentvelsen, StanMeyer, IrmtraudThe Cambridge Jet Algorithm: features and applicationsDetectors and Experimental TechniquesJet clustering algorithms are widely used to analyse hadronic events in high energy collisions. Recently a new clustering method, known as `Cambridge', has been introduced. In this article we present an algorithm to determine the transition values of ycut for this clustering scheme, which allows to resolve any event to a definite number of jets in the final state. We discuss some particularities of the Cambridge clustering method and compare its performance to the Durham clustering scheme for Monte Carlo generated e+e- annihilation events.Jet clustering algorithms are widely used to analyse hadronic events in high energy collisions. Recently a new clustering method, known as `Cambridge', has been introduced. In this article we present an algorithm to determine the transition values of y_cut for this clustering scheme, which allows to resolve any event to a definite number of jets in the final state. We discuss some particularities of the Cambridge clustering method and compare its performance to the Durham clustering scheme for Monte Carlo generated e+e- annihilation events.hep-ph/9803322CERN-EP-98-043CERN-EP-98-043oai:cds.cern.ch:3767611998-03-11
spellingShingle Detectors and Experimental Techniques
Bentvelsen, Stan
Meyer, Irmtraud
The Cambridge Jet Algorithm: features and applications
title The Cambridge Jet Algorithm: features and applications
title_full The Cambridge Jet Algorithm: features and applications
title_fullStr The Cambridge Jet Algorithm: features and applications
title_full_unstemmed The Cambridge Jet Algorithm: features and applications
title_short The Cambridge Jet Algorithm: features and applications
title_sort cambridge jet algorithm: features and applications
topic Detectors and Experimental Techniques
url https://dx.doi.org/10.1007/s100520050232
http://cds.cern.ch/record/376761
work_keys_str_mv AT bentvelsenstan thecambridgejetalgorithmfeaturesandapplications
AT meyerirmtraud thecambridgejetalgorithmfeaturesandapplications
AT bentvelsenstan cambridgejetalgorithmfeaturesandapplications
AT meyerirmtraud cambridgejetalgorithmfeaturesandapplications

Ejemplares similares