45 | | with the final weight computed by recombining these weights according to the prescription given before. |
46 | | |
47 | | The actual implementation in MadGraph5_aMC@NLO is slightly more complicated, owing to the procedure adopted in the computation of the virtual contribution (see sect.2.4.3 http://arxiv.org/pdf/1405.0301.pdf). This speed optimisation method prevents one from performing the reweighting as written above, since there is the possibility that $\mathcal{W}_V^{old}=0$ even if $V_{old} \neq 0$. To avoid this problem, $\mathcal{W}_B$ is split in two pieces :$\mathcal{W}_{BC}$, $\mathcal{W}_{BB}$. $\mathcal{W}_{BC}$ is the part, proportional to the Born, related to the one of the counterterms, while $\mathcal{W}_{BB}$ includes all of the other contributions (the Born itself and the approximate virtual). |
| 45 | with the final weight computed by recombining these weights according to the prescription given before. This method of reweighting is called "NLO_basic". |
| 46 | |
| 47 | |
| 48 | In MadGraph5_aMC@NLO, we have implemented a second NLO accurate method of re-weighting. This method dubbed "NLO_VT" is expected to have a smaller statistical uncertainty than the basic one. One potential problem of the "NLO_basic" method is related to the procedure adopted in the computation of the virtual contribution (see sect.2.4.3 http://arxiv.org/pdf/1405.0301.pdf). This speed optimisation method can easily statistical error associated to a sub-sample of events. To estimate such effect we propose this second reweighting method --which should be less sensitive to such effects--. The difference between those two methods should be seen as a systematics. |
| 49 | For this re-weighting, $\mathcal{W}_B$ is split in two pieces :$\mathcal{W}_{BC}$, $\mathcal{W}_{BB}$. $\mathcal{W}_{BC}$ is the part, proportional to the Born, related to the one of the counterterms, while $\mathcal{W}_{BB}$ includes all of the other contributions (the Born itself and the approximate virtual). |