10 - H1 - Desy
10 - H1 - Desy
10 - H1 - Desy
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
114 Cross section building<br />
8.4 Cross section building<br />
In the previous section the details of the unfolding procedure were introduced. As the<br />
result of all the steps the multidimensional unfolding output and error matrix are obtained.<br />
In this part, the construction of final cross section is explained.<br />
8.4.1 Bin averaging procedure<br />
The output of the unfolding procedure is the multidimensional vector ⃗x true and corresponding<br />
error matrix E x . In most cases final results are quoted as single differential<br />
cross sections, where unfolding output was projected along all unused dimensions. Such<br />
an approach allows the reduction of the final error, particularly in case of averaging over<br />
likely produced during unfolding anticorrelated bins. Table 8.6 presents the averaged<br />
dimensions for all the final cross sections.<br />
Cross section Variable Unfolding Code Output Variables Averaging<br />
i E γ T<br />
A E γ T × ηγ η γ<br />
ii η γ A E γ T × ηγ E γ T<br />
iii E γ T<br />
B E γ T × ηγ η γ<br />
iv η γ B E γ T × ηγ E γ T<br />
v E jet<br />
T<br />
C E γ T × ηγ × E jet<br />
T<br />
E γ T , ηγ<br />
vi η jet D E γ T × ηγ × η jet E γ T , ηγ<br />
vii x LO<br />
γ E E γ T × ηγ × x LO<br />
γ E γ T , ηγ<br />
viii x LO<br />
p F E γ T × ηγ × x LO<br />
p E γ T , ηγ<br />
ix p ⊥ G E γ T × ηγ × p ⊥ E γ T , ηγ<br />
x ∆φ H E γ T × ηγ × ∆φ E γ T , ηγ<br />
xi p ⊥ I E γ T × ηγ × p ⊥ E γ T , ηγ<br />
xii ∆φ J E γ T × ηγ × ∆φ E γ T , ηγ<br />
Table 8.6: Averaging dimensions for all the final cross sections.<br />
The number of photons in the final bin k with all contributing ⃗x true bins i is calculated as<br />
N k = ∑ i<br />
(⃗x true ) i (8.31)<br />
The error matrix E is obtained in a similar way<br />
E k,l = ∑ i,j<br />
E xi,j (8.32)<br />
where bins i are output bins contributing to the final bin k and bins j are the ones contributing<br />
to l. Since the elements of matrix E x can take positive as well as negative values,<br />
error cancellation is possible (though regularisation largely decrease its probability).