Pith. Sign in

REVIEW

MadEvent: Automatic Event Generation with MadGraph

High Energy Physics - Phenomenology · Submitted 15 Aug 2002 · 23 references

Pith's verdict: The decomposition in Eq. 2.5 is a real and exact idea with a working public implementation; the efficiency claim that motivates it is asserted, never measured.

T0 · AI review

How this review was made: An AI referee (selfhosted/deepseek-v4.1-flash) read the paper on October 29, 2026 and answered a fixed list of questions about it. T0 is the starting level every paper gets. The levels describe how deeply Pith has checked the paper, never the authors.

  1. T0 AI review An AI read the paper and answered a fixed list of questions.
  2. T1 Audit Automatic checks that the references and files the paper relies on exist and match.
  3. T2 Compute The paper's code or calculations re-run with the same results.
  4. T3 Formal statement The claims written out in a formal math language a computer can read.
  5. T4 Proof Those claims proved, and the proof checked by computer.

How Pith checks papers →

· 4 major objections · 7 minor · Ask about this paper · The compiled record · Read the full review →
Challenge this review Comment (0) Read on arXiv ↗
Cite ▾
arXiv IDhep-ph/0208156 (version 1)
Pith IDIUUNPYXN, Pith's permanent record of this paper and its review
CitationFabio Maltoni, Tim Stelzer. "MadEvent: Automatic Event Generation with MadGraph." arXiv:hep-ph/0208156 (2002). https://pith.science/paper/IUUNPYXN
Cite this reviewBibTeX for Pith's review of this paper
Claim paper

Why Pith says this

Highlight any text to comment on it.

Referee report
The paper

The paper claims

The paper proposes replacing one hard multi-channel Monte Carlo integral with one independent integration per Feynman diagram, each mapped by its own channel, and implements the scheme in the event generator MadEvent.

The reading

Generating simulated collisions for processes with many jets is hard for two reasons: the number of parton-level subprocesses explodes (the paper counts 498 distinct subprocesses for $W$ plus four jets at a proton–proton collider), and each squared amplitude has sharp peaks spread over a high-dimensional phase space. The standard fix is multi-channel Monte Carlo, where several mappings of the integration variables are blended with weights $g(Φ) = Σ_i α_i g_i(Φ)$; the paper argues this becomes inefficient and hard to control as channels multiply, because every sampled point forces you to evaluate all channels. The authors propose instead to write the integrand exactly as a sum of non-negative pieces, one per Feynman diagram, each weighted by that diagram's share of the total squared amplitude, and to integrate each piece separately with a mapping read off that diagram's propagators. If this works, the cost of a channel no longer depends on how many other channels exist, the integrations can be run on separate machines, and computing time can be steered toward the channels that actually contribute. The paper backs the scheme with benchmark cross sections at the Tevatron and the LHC for vector-boson, heavy-quark, and Higgs processes accompanied by jets.

What carries the argument

The load-bearing object is the diagram-by-diagram decomposition $f_i = (|A_i|^2 / Σ_j |A_j|^2)|A_{tot}|^2$, paired with a channel $g_i$ obtained from the propagator structure of diagram $i$. The decomposition does the bookkeeping: it converts a single integrand with many overlapping peaks into a set of integrands each of which is supposed to have one dominant peak, and it makes the sum over diagrams a sum over independent Monte Carlo runs. The mapping does the work: because a propagator going on shell or a collinear splitting produces a known peak shape, MadGraph can read off, per diagram, the variable transformation that flattens that peak, and hand it to MadEvent. Together they turn the question 'which channel should I sample this point from?' into 'which diagram does this point belong to?', which is answered before any sampling happens.

Extended reading notes

Core claim

The central claim is an identity plus an efficiency argument. The identity is that the squared amplitude can be decomposed as $f = Σ_i f_i$ with $f_i = (|A_i|^2 / Σ_j |A_j|^2) |A_{tot}|^2$, where $A_i$ is a single Feynman diagram and $A_{tot} = Σ_i A_i$; each $f_i$ is non-negative and the pieces sum exactly to $|A_{tot}|^2$, so the total integral is a sum of $n$ independent integrals, $I = Σ_i I_i$. The efficiency argument is that the peak structure of each $f_i$ is claimed to be the same as that of the single squared diagram $|A_i|^2$, so a single channel $g_i$ derived from the propagator structure of diagram $i$ is enough to map it. The authors call this Single-Diagram-Enhanced multi-channel integration, and they list its consequences: a weight in one channel never requires computing the others, so the computational complexity does not grow with the number of channels; the channels are parallel in nature; and the analogue of the usual blending weights can be set to $α_i = I_i / I$, so that Monte Carlo effort tracks each channel's share of the answer. They also note the decomposition is modular: identical final-state particles allow a reduction by $k!$, diagrams with no peaked behaviour can be dropped, and diagrams can be grouped when coherence arguments predict the combined mapping. MadEvent, built on a new version of MadGraph, automates the whole chain from a user-specified process to amplitudes, phase-space mappings, cross sections, and unweighted events in the Les Houches format.

Load-bearing premise

The efficiency claim depends on the assertion that each piece $f_i$ has the same peak structure as the single squared diagram $|A_i|^2$, even though $f_i$ also carries the multiplicative factor $|A_{tot}|^2 / Σ_j |A_j|^2$, which is not constant and can vary sharply wherever diagrams interfere.

Editorial extensions

If this is right

  • Cross sections and unweighted event samples for high-multiplicity processes such as $W$ plus up to four jets, $t\bar{t}$ plus jets, and $b\bar{b}b\bar{b}$ plus jets become obtainable from a single automated tool, with the paper's benchmark tables at $\sqrt{s}=2$ TeV and $14$ TeV serving as reference values.
  • Because each channel is an independent integration, the work can be spread across a farm of machines and combined only at the end, and channels with small $α_i = I_i/I$ can be sampled with fewer points for a fixed target accuracy.
  • Phase-space mappings for processes with several competing on-shell regions, such as $W^+W^-$ where a $Z$ and a $W$, or both $W$'s, can be near their masses, are generated automatically rather than by hand, so no approximation needs to be introduced there.
  • The generated events carry spin, colour connection, and flavour information per final-state parton in the Les Houches format, so they can be passed to a shower and hadronization program without further processing.
  • The approach inherits a practical ceiling from the diagram count rather than from the integration: the package as shipped handles up to ten thousand diagrams per subprocess, which makes $W$ plus five jets feasible but close to the limit.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The decomposition is exact for any set of diagrams, so the method's real content is a statement about variance, not about correctness; a natural test would be to compare per-channel variance against a conventional multi-channel fit on a process with strong interference, where the ratio $|A_{tot}|^2 / Σ_j |A_j|^2$ swings widely.
  • If the per-diagram mapping is efficient, the same decomposition should be usable as a Born-level sampling engine for matching to parton showers, since each event would arrive already tagged with the diagram that generated it.
  • The scheme suggests a diagnostic for interference: the ratio $|A_{tot}|^2 / Σ_j |A_j|^2$ is a bounded, computable quantity per phase-space point, and its distribution over the sample would quantify how much of the integrand is genuinely multi-diagram rather than single-diagram.
  • Because channels can be dropped or merged without breaking the identity, the method invites a cost-aware pruning rule: keep only diagrams whose $I_i$ exceeds some fraction of $I$, and the residual bias is bounded by the discarded integrals.
Original abstract

We present a new multi-channel integration method and its implementation in the multi-purpose event generator MadEvent, which is based on MadGraph. Given a process, MadGraph automatically identifies all the relevant subprocesses, generates both the amplitudes and the mappings needed for an efficient integration over the phase space, and passes them to MadEvent. As a result, a process-specific, stand-alone code is produced that allows the user to calculate cross sections and produce unweighted events in a standard output format. Several examples are given for processes that are relevant for physics studies at present and forthcoming colliders.

The compiled record

The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Compiled by classifier-1.13-20260917 via OpenRouter, question bank abstract-p1-20260923, 2026-09-23: 1 request, 3,605 input tokens, $0.0002 reported.

What the abstract itself states, as probabilities: claims first 0.09 · states limitation 0.05 · human participants 0.02 · controlled comparison 0.02 · randomized assignment 0.01 · states quantitative result 0.04 · compares with prior results 0.07 · mentions code or data availability 0.21.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; .

We present a new multi-channel integration method and its implementation in the multi-purpose event generator MadEvent, which is based on MadGraph. Given a process, MadGraph automatically identifies all the relevant subprocesses, generates both the amplitudes and the mappings needed for an efficient integration over the phase space, and passes them to MadEvent. As a result, a process-specific, stand-alone code is produced that allows the user to calculate cross sections and produce unweighted events in a standard output format. Several examples are given for processes that are relevant for physics studies at present and forthcoming colliders.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 We present a new multi-channel integration method and its implementation in the multi-purpose event generator MadEvent, which is based on MadGraph. contribution 1.00 0.90 0.29 asserted 1.00
s1 Given a process, MadGraph automatically identifies all the relevant subprocesses, generates both the amplitudes and the mappings needed for an efficient integration over the phase space, and passes them to MadEvent. method 0.98 0.41 0.07 asserted 1.00
s2 As a result, a process-specific, stand-alone code is produced that allows the user to calculate cross sections and produce unweighted events in a standard output format. result 0.61 0.68 0.29 asserted 1.00
s3 Several examples are given for processes that are relevant for physics studies at present and forthcoming colliders. contribution 0.58 0.80 0.06 asserted 0.99

What kind of paper the classifier reports this is: method or tool 1.00 · evidence from simulation or computation 0.99.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

References
How later papers used it

269 later papers cite it

Evidence: substantial. 254 of the citing papers share no author with it, and 189 of those carry a confident label from Pith's citation classifier.

Pith read 40 of the 335 citing sentences, choosing only those whose citation markers point at this paper alone, and wrote the paraphrases from them. The summary, the counts, the evidence level, the links and the quotes come from code; the summary counts the papers listed below. A later paper is listed under a label when Pith's citation classifier gives one of its sentences that label at probability 0.8 or more (0.95 for support), Pith's reading finds that the citing paper itself did it, and a second check confirms the paraphrase against the sentence. This section lists uses only. It does not list criticism or disagreement, so their absence here says nothing about how the paper has been received. Papers that share an author with this one are listed apart, under "By the same authors". A quote is the citing authors' own sentence, shown when their paper's licence is CC BY, CC BY-SA or CC0. JSON

Uses its method or tool 29 of 185 papers with this label
How the literature uses it

244 arXiv papers cite this in 308 sentences

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

Papers citing it · 61 sentences without a confident label

Contests it 1 paper
Uses its method or tool 169 papers
Uses its data or values 3 papers
Compares with it 10 papers
  • We compared the tree-level (Born and real-emission) matrix elements to those obtained from [ref] , while the matix element for the virtual correction, including the first three terms in the Laurent expansion in the dimensional regularisation parameter $$ was compared to that from [ref] in randomly chosen phase space points.

    Top quark pair production in association with a Z-boson at NLO accuracy · Introduction · 1.00

  • We first validate the algorithm by using the simple LO cross section from eq:losigma and comparing the output of with that of [ref] .

    GenEvA (II): A phase space generator from a reweighted parton shower · Results · 0.99

  • The cross sections fall rapidly with $R^-1$ and vary over several orders of magnitude, $q^1Z^1$ having the smallest cross section and $Q^1W^1$ the largest (in $pb$ order for $R^-1 ∼500$ GeV)[Our cross sections are in almost complete agreement with the ones obtained using MADGRAPH [ref] and FEYNRULES [ref] (more precisely, FR-MUED).].

    Exploring the Universal Extra Dimension at the LHC · Productions and decay of the first KK-mode · 0.89

Cites it as background 30 papers
  • In the literature [ref] a common approach when using surrogates is to use it within importance sampling, while relying on standard hit and miss to generate event following the surrogate density function, which is conceptually equivalent to other importance sampling algorithm (based on ML or not) [ref] .

    Amplitude Surrogates for Multi-Jet Processes · Achievable speed-up without double-unweighting · 0.91

  • These ideas underpin many automatic phase-space generators and matrix-element tools, including dedicated algorithms and libraries developed to handle complex multi-particle final states [ref] .

    Multi-channel phase space with Feynman-diagram-gauge amplitudes · Introduction · 0.88

  • For leading order processes there have been many developments concerning event generation and simulation tools in the last two decades such as MadGraph/MadEvent [ref] CompHEP/CalcHEP [ref] / [ref] , SHERPA [ref] and WHIZARD [ref] and also programs using different approaches such as ALPGEN [ref] and HELAC [ref] .

    Automation of the Dipole Subtraction Method in MadGraph/MadEvent · Introduction · 0.96

Discussion

Disagree with the review, or know something it missed? Leave a comment, highlight any passage above to comment on it, or challenge this review formally.