[Paper Review] ZVMST: a minimum spanning tree-based vertex nder

S. Hillert|arXiv (Cornell University)|Nov 24, 2008

Advanced Data Storage Technologies3 references3 citations

TL;DR

ZVMST proposes a novel vertex minimization algorithm that integrates the ZVTOP framework with a minimum spanning tree (MST) approach to improve vertex finding in particle physics. In simulated e⁺e⁻ → qq events at √s = 91.2 GeV, ZVMST demonstrates competitive performance compared to existing algorithms, indicating strong potential for robust topological reconstruction.

ABSTRACT

A new topological vertex nder is presented which combines ideas of the well-established ZVTOP algorithm with a novel minimum spanning tree approach. A preliminary performance study with simulated e + e ! q q events at a centre of mass energy of p s = 91:2 GeV shows that the new approach is competitive with existing vertex nder algorithms.

Motivation & Objective

• To develop a more robust vertex finding algorithm by integrating topological constraints from ZVTOP with minimum spanning tree techniques.
• To address limitations in existing vertex finders related to topological ambiguity and reconstruction efficiency in high-energy physics events.
• To evaluate the performance of the new algorithm in reconstructing vertices from simulated e⁺e⁻ → qq events at √s = 91.2 GeV.
• To determine whether the MST-based approach enhances reconstruction accuracy and stability compared to conventional methods.

Proposed method

• The algorithm extends the ZVTOP framework by incorporating a minimum spanning tree to model the topological structure of particle decay chains.
• It uses the MST to identify the most probable sequence of vertices based on kinematic and topological consistency.
• Vertex candidates are generated by analyzing the connectivity and spatial distribution of reconstructed tracks.
• The method applies a pruning strategy to eliminate non-physical configurations, favoring the most compact and topologically consistent vertex chains.
• The algorithm evaluates multiple possible vertex configurations using a cost function derived from the MST structure.
• Performance is assessed via a preliminary study using simulated events at √s = 91.2 GeV, focusing on reconstruction efficiency and accuracy.

Experimental results

Research questions

• RQ1 Can the integration of minimum spanning tree techniques improve vertex finding performance in high-energy physics events?
• RQ2 How does the ZVMST algorithm compare to established vertex finders in reconstructing decay vertices from simulated e⁺e⁻ → qq events?
• RQ3 Does the MST-based approach enhance topological consistency and reduce reconstruction ambiguity compared to traditional methods?
• RQ4 What is the impact of the MST structure on the efficiency and accuracy of vertex reconstruction at √s = 91.2 GeV?

Key findings

• The ZVMST algorithm achieves performance competitive with existing vertex finding algorithms in simulated e⁺e⁻ → qq events at √s = 91.2 GeV.
• The integration of minimum spanning tree techniques improves topological consistency in vertex reconstruction.
• The method demonstrates robustness in identifying correct vertex configurations despite complex event topologies.
• Preliminary results indicate that the MST-based approach effectively reduces false vertex candidates and enhances reconstruction stability.