Exclusive Jet Study With Kt, AntiKt and Cambridge Aachen Jet Finders
Legend Info:
- Signal - Purple
- NP0 - Black
- NP1 - Red
- NP2 - Green (Also Sum of the Backgrounds)
- NP3 - Blue
Kt Jet Finder
The K
t jet finding algorithm can be broken down into three steps.
1) For each particle i, j in the event the K
t distance is calculated d
ij = min(P^2
ti,P^2
tj) ΔR ^2
ij / R
Where ΔR
ij= (Δeta
i - Δeta
j)^2 + (Δphi
i - Δphi
j)^2
The Kt distance from particle i to the beam is also calculated
d
ij = P^2
iB
2) The next step is to find the dmin value for all dij and diB. (Note there are differences between the Inclusive and Exclusive K
t Jet algorithms)
- INCLUSIVE Kt Jet Algorithm:
If d
ij is the dmin value then the i, j particles are combined ( the particles four momenta are summed together).
if d
iB is the dmin value then the particle i is a final jet and the particle i is removed from the list.
- Exclusive Kt Jet Algorithm:
If d
ij is the dmin value and is less than dcut then the i, j particles are combined ( the particles four momenta are summed together).
if d
iB is the dmin value and is less than dcut then the particle i combined with the beam jet.
3)
- INCLUSIVE Kt Jet Algorithm:
This process is repeated until no more particles are left.
- Exclusive Kt Jet Algorithm:
This process ends when all d
ij and d
iB are above the dcut value.
The dcut variable again varies when considering an inclusive or exclusive event.
When looking at an exclusive n-jet event.
dcut = P
tmin^(2)
This maintains the jet algorithm ability to factorize the initial-state of the collinear singularities, which allows you to obtain a finite cross-section.
When looking at an inclusive jet event.
dcut = E
t^(2)
Signal and Background Comparisons (Bin Width 100 GeV^2)
Signal and Background Comparisons Not Normalized
Fig1.1
Signal and Background Comparisons Normalized (1/sigma dsigma/dDmin [GeV-2] )
Fig2.1
Signal and Background Comparisons Normalized (dsigma/dDmin [pb/GeV^2] )
Fig3.1
Signal and Sum of Background Comparisons Normalized (dsigma/dDmin [pb/GeV^2] )
Fig4.1
Signal and Background Comparisons (Binned in Log(Dmin))
Signal and Background Comparisons Not Normalized
Fig5.1
Signal and Background Comparisons Normalized (1/sigma dsigma/dDmin [GeV-2] )
Fig6.1
Signal and Background Comparisons Normalized (dsigma/dDmin [pb/GeV^2] )
Fig7.1
Signal and Sum of Background Comparisons Normalized (dsigma/dDmin [pb/GeV^2] )
Fig8.1
Signal and Sum of Background Comparisons Normalized (1/sigma dsigma/dDmin [GeV-2] )
Fig9.1
The Anti-Kt Algorithm follows the same procedure as the K
t algorithm explained above. The differences between these two algorithms are the definitions for d
ij and d
iB.
d
ij = min(1/P^2
ti,1/P^2
tj) ΔR ^2
ij / R
and
d
ij = 1/P^2
iB
*************** These plots are for R=1
*******************************************
Signal and Background Comparisons (Bin Width 100 GeV^2)
Signal and Background Comparisons Not Normalized
Fig10.1
Signal and Background Comparisons Normalized (1/sigma dsigma/dDmin [GeV-2] )
Fig11.1
Signal and Background Comparisons Normalized (dsigma/dDmin [pb/GeV^2] )
Fig12.1
Signal and Sum of Background Comparisons Normalized (dsigma/dDmin [pb/GeV^2] )
Fig13.1
Signal and Background Comparisons (Binned in Log(Dmin))
Signal and Background Comparisons Not Normalized
Fig14.1
Signal and Background Comparisons Normalized (1/sigma dsigma/dDmin [GeV-2] )
Fig15.1
Signal and Background Comparisons Normalized (dsigma/dDmin [pb/GeV^2] )
Fig16.1
Signal and Sum of Background Comparisons Normalized (dsigma/dDmin [pb/GeV^2] )
Fig17.1
Signal and Sum of Background Comparisons Normalized (1/sigma dsigma/dDmin [GeV-2] )
Fig18.1
--
MichaelWright - 2010-10-06