|
| 1 | +# Jet Reconstruction |
| 2 | + |
| 3 | +This package implements sequential Jet Reconstruction (clustering) algorithms, |
| 4 | +which are used in high-energy physics as part of event reconstruction for $pp$ |
| 5 | +and $e^+e^-$ colliders. |
| 6 | + |
| 7 | +## Algorithms |
| 8 | + |
| 9 | +Algorithms used are based on the C++ FastJet package (<https://fastjet.fr>, |
| 10 | +[hep-ph/0512210](https://arxiv.org/abs/hep-ph/0512210), |
| 11 | +[arXiv:1111.6097](https://arxiv.org/abs/1111.6097)), reimplemented natively in |
| 12 | +Julia. |
| 13 | + |
| 14 | +The algorithms include ``\text{anti}-{k}_\text{T}``, Cambridge/Aachen and |
| 15 | +inclusive ``k_\text{T}``. |
| 16 | + |
| 17 | +## Reconstruction Interface |
| 18 | + |
| 19 | +The main interface for reconstruction is: |
| 20 | + |
| 21 | +```@docs |
| 22 | +jet_reconstruct(particles; p = -1, R = 1.0, recombine = +, strategy = RecoStrategy.Best) |
| 23 | +``` |
| 24 | + |
| 25 | +The object returned is a `ClusterSequence`, which internally tracks all merge steps. |
| 26 | + |
| 27 | +```@docs |
| 28 | +ClusterSequence |
| 29 | +``` |
| 30 | + |
| 31 | +## Strategy |
| 32 | + |
| 33 | +Three strategies are available for the different algorithms: |
| 34 | + |
| 35 | +| Strategy Name | Notes | Interface | |
| 36 | +|---|---|---| |
| 37 | +| `RecoStrategy.Best` | Dynamically switch strategy based on input particle density | `jet_reconstruct` | |
| 38 | +| `RecoStrategy.N2Plain` | Global matching of particles at each interation (works well for low $N$) | `plain_jet_reconstruct` | |
| 39 | +| `RecoStrategy.N2Tiled` | Use tiles of radius $R$ to limit search space (works well for higher $N$) | `tiled_jet_reconstruct` | |
| 40 | + |
| 41 | +Generally one can use the `jet_reconstruct` interface, shown above, as the *Best* strategy safely as the overhead is extremely low. That interface supports a `strategy` option to switch to a different option. |
| 42 | + |
| 43 | +Another option, if one wishes to use a specific strategy, is to call that strategy's interface directly, e.g., |
| 44 | + |
| 45 | +```julia |
| 46 | +# For N2Plain strategy called directly |
| 47 | +plain_jet_reconstruct(particles::Vector{T}; p = -1, R = 1.0, recombine = +) |
| 48 | +``` |
| 49 | + |
| 50 | +Note that there is no `strategy` option in these interfaces. |
| 51 | + |
| 52 | +## Inclusive and Exclusive Selections |
| 53 | + |
| 54 | +To obtain final jets both inclusive (``p_T`` cut) and exclusive (``n_{jets}`` or |
| 55 | +``d_{ij}`` cut) selections are supported: |
| 56 | + |
| 57 | +```@docs |
| 58 | +inclusive_jets(clusterseq::ClusterSequence, ptmin = 0.0) |
| 59 | +``` |
| 60 | + |
| 61 | +```@docs |
| 62 | +exclusive_jets(clusterseq::ClusterSequence; dcut = nothing, njets = nothing) |
| 63 | +``` |
| 64 | + |
| 65 | +The number of exclusive jets passing a particular `dcut` can be obtained: |
| 66 | + |
| 67 | +```@docs |
| 68 | +n_exclusive_jets(clusterseq::ClusterSequence; dcut::AbstractFloat) |
| 69 | +``` |
| 70 | + |
| 71 | +### Sorting |
| 72 | + |
| 73 | +Sorting vectors is trivial in Julia, no special sorting methods are provided. As |
| 74 | +an example, to sort exclusive jets of ``>5.0`` (usually GeV, depending on your |
| 75 | +EDM) from highest energy to lowest: |
| 76 | + |
| 77 | +```julia |
| 78 | +sorted_jets = sort!(inclusive_jets(cs::ClusterSequence; ptmin=5.0), |
| 79 | + by=JetReconstruction.energy, rev=true) |
| 80 | +``` |
| 81 | + |
| 82 | +## Plotting |
| 83 | + |
| 84 | + |
| 85 | + |
| 86 | +To visualise the clustered jets as a 3d bar plot (see illustration above) we now |
| 87 | +use `Makie.jl`. See the `jetsplot` function in `ext/JetVisualisation.jl` and its |
| 88 | +documentation for more. There are two worked examples in the `examples` |
| 89 | +directory. |
| 90 | + |
| 91 | +The plotting code is a package extension and will load if the one of the `Makie` |
| 92 | +modules is loaded in the environment. |
| 93 | + |
| 94 | +## Serialisation |
| 95 | + |
| 96 | +The package also provides methods such as `loadjets`, `loadjets!`, and |
| 97 | +`savejets` that one can use to save and load objects on/from disk easily in a |
| 98 | +very flexible format. See documentation for more. |
| 99 | + |
| 100 | +## Reference |
| 101 | + |
| 102 | +Although it has been developed further since the CHEP2023 conference, the CHEP |
| 103 | +conference proceedings, |
| 104 | +[10.1051/epjconf/202429505017](https://doi.org/10.1051/epjconf/202429505017), |
| 105 | +should be cited if you use this package: |
| 106 | + |
| 107 | +```bibtex |
| 108 | +@article{refId0, |
| 109 | + author = {{Stewart, Graeme Andrew} and {Gras, Philippe} and {Hegner, Benedikt} and {Krasnopolski, Atell}}, |
| 110 | + doi = {10.1051/epjconf/202429505017}, |
| 111 | + journal = {EPJ Web of Conf.}, |
| 112 | + pages = {05017}, |
| 113 | + title = {Polyglot Jet Finding}, |
| 114 | + url = {https://doi.org/10.1051/epjconf/202429505017}, |
| 115 | + volume = 295, |
| 116 | + year = 2024, |
| 117 | + eprint={2309.17309}, |
| 118 | + archivePrefix={arXiv}, |
| 119 | + primaryClass={hep-ex} |
| 120 | +} |
| 121 | +``` |
| 122 | + |
| 123 | +The original paper on [arXiv](https://arxiv.org/abs/2309.17309) is: |
| 124 | + |
| 125 | +```bibtex |
| 126 | +@misc{stewart2023polyglot, |
| 127 | + title={Polyglot Jet Finding}, |
| 128 | + author={Graeme Andrew Stewart and Philippe Gras and Benedikt Hegner and Atell Krasnopolski}, |
| 129 | + year={2023}, |
| 130 | + eprint={2309.17309}, |
| 131 | + archivePrefix={arXiv}, |
| 132 | + primaryClass={hep-ex} |
| 133 | +} |
| 134 | +``` |
| 135 | + |
| 136 | +## Authors and Copyright |
| 137 | + |
| 138 | +Code in this package is authored by: |
| 139 | + |
| 140 | +- Atell Krasnopolski <[email protected]> |
| 141 | +- Graeme A Stewart < [email protected]> |
| 142 | +- Philippe Gras < [email protected]> |
| 143 | + |
| 144 | +and is Copyright 2022-2024 The Authors, CERN. |
| 145 | + |
| 146 | +The code is under the MIT License. |
0 commit comments