REVIEW 3 cited by
Competing Sudakov Veto Algorithms
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
We present a way to analyze the distribution produced by a Monte Carlo algorithm. We perform these analyses on several versions of the Sudakov veto algorithm, adding a cutoff, a second variable and competition between emission channels. The analysis allows us to prove that multiple, seemingly different competition algorithms, including those that are currently implemented in most parton showers, lead to the same result. Finally, we test their performance and show that there are significantly faster alternatives to the commonly used algorithms.
Forward citations
Cited by 3 Pith papers
-
Sudakov evolution without unitarity
Sunshine removes Sudakov factors from parton-shower sampling by keeping every intermediate state, giving direct tree-level expansions and enabling tests of matrix-element corrections.
-
A Demonstration of ARCANE Reweighting: Reducing the Sign Problem in the MC@NLO Generation of $e^+ e^- \rightarrow q \bar{q} + 1\, jet$ Events
ARCANE reweighting cuts the post-unweighting negative-event fraction in e+e- -> q qbar + 1 jet MC@NLO generation from about 2.25% to below 10^-5 while preserving the visible event distributions.
-
ARCANE Reweighting: A Monte Carlo Technique to Tackle the Negative Weights Problem in Collider Event Generation
ARCANE reweighting adds a carefully designed, zero-average correction to event weights so that positive and negative pathways to the same event cancel, preserving all physical distributions.
Discussion (0). Continue with ORCID to comment.