Abstract
Multiparticle correlators are mathematical objects frequently encountered in quantum field theory and collider physics. By translating multiparticle correlators into the language of graph theory, we can gain new insights into their structure as well as identify efficient ways to manipulate them. We highlight the power of this graph-theoretic approach by “cutting open” the vertices and edges of the graphs, allowing us to systematically classify linear relations among multiparticle correlators and develop faster methods for their computation. The naive computational complexity of an -point correlator among particles is , but when the pairwise distances between particles can be cast as an inner product, we show that all such correlators can be computed in linear run-time. With the help of new tensorial objects called energy flow moments, we achieve a fast implementation of jet substructure observables like and , which are widely used at the Large Hadron Collider to identify boosted hadronic resonances. As another application, we compute the number of leafless multigraphs with edges up to , conjecturing that this is the same as the number of independent kinematic polynomials of degree , previously known only to (279).
- Received 17 November 2019
- Accepted 4 February 2020
DOI:https://doi.org/10.1103/PhysRevD.101.036019
Published by the American Physical Society under the terms of the Creative Commons Attribution 4.0 International license. Further distribution of this work must maintain attribution to the author(s) and the published article’s title, journal citation, and DOI. Funded by SCOAP3.
Published by the American Physical Society