The Sudakov Veto Algorithm Reloaded
Abstract
We perform a careful analysis of the main Monte Carlo algorithm used in parton shower simulations, the Sudakov veto algorithm. We prove a general version of the algorithm, directly including the dependence on the infrared cutoff. Taking this as a starting point, we then consider non-positive definite splitting kernels, as encountered when dealing with sub-leading colour correlations or splitting kernels beyond leading order. New algorithms suited for these situations are developed.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.