How does MG5_aMC calculate the MC errors of a histogram bin-by-bin
Dear everyone,
Previously, Valentin Hirschi told me how to get the Monte-Carlo errors of a histogram bin-by-bin. I want to konw how the MG5_aMC code calculates these Errors?
When I look at the code HwU.f, there is a function called
subroutine set_error_
There 3 options for variable input.
c Error estimation
c input 0: Simply sum all PS points; error is estimated by assuming
c Binomial statistics: use for unweighted events. (Assumes that
c all events have equal weight (up to a sign)).
c input 1: Simply sum all PS points; error is estimated by the
c variance between the separate iterations. This assumes that
c each iteration has the same number of PS points (This is the
c topdrawer default in MG5_aMC).
c input 2: Sum PS points for a given iteration and error estimate by
c square root of the sum of the squares. Perform a weighted average
c iteration-
And when I search the code, I found only the the following parts invoke this function,
./MCatNLO/
./MCatNLO/
However, when I use fixed-order calculation, and parton-shower program neither herwig nor pythia is invoked, in principle.
So, how does the MadGraph internal code to estimate the Monte-Carlo error bin-by-bin?
Further, for input=1(2), the errors are estimated through the iterations. What does this iterations mean? Does it mean the iteration of VEGAS when it optimizes the Monte-Calor integration? If yes, which option should I choose for fixed-order calculations.
Best regards,
Keping
Question information
- Language:
- English Edit question
- Status:
- Solved
- Assignee:
- Valentin Hirschi Edit question
- Solved by:
- Valentin Hirschi
- Solved:
- Last query:
- Last reply: