By Topic

Sensitivity of robust vertex fitting algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
D'Hondt, J. ; Vrije Univ. Brussel, Brussels, Belgium ; Fruhwirth, R. ; Vanlaer, P. ; Waltenberger, W.

Robust vertex fitting algorithms are expected to improve the knowledge of the vertex position and of its uncertainty in the presence of mismeasured or misassociated tracks. Such contaminations are likely to happen in real data as well as in realistic detector simulations. This paper describes a simulation study of the sensitivity of two types of robust algorithms: a trimmed least squares estimator and an adaptive estimator. The statistical properties of the algorithms are studied as a function of the source and the level of contamination, and compared to the results obtained with classical least squares estimators. Two typical event topologies are studied: one resembling a high multiplicity primary vertex with a possible contamination from a nearby vertex and one resembling a low multiplicity secondary vertex in a jet.

Published in:

Nuclear Science, IEEE Transactions on  (Volume:51 ,  Issue: 5 )