skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: The use of minimal spanning trees in particle physics

Abstract

Minimal spanning trees (MSTs) have been used in cosmology and astronomy to distinguish distributions of points in a multi-dimensional space. They are essentially unknown in particle physics, however. We briefly define MSTs and illustrate their properties through a series of examples. We show how they might be applied to study a typical event sample from a collider experiment and conclude that MSTs may prove useful in distinguishing different classes of events.

Authors:
 [1];  [1]
  1. Northwestern Univ., Evanston, IL (United States). Dept. of Physics and Astronomy
Publication Date:
Research Org.:
Northwestern Univ., Evanston, IL (United States)
Sponsoring Org.:
USDOE Office of Science (SC), High Energy Physics (HEP) (SC-25)
OSTI Identifier:
1424587
Grant/Contract Number:
SC0010143
Resource Type:
Journal Article: Accepted Manuscript
Journal Name:
Journal of Instrumentation
Additional Journal Information:
Journal Volume: 12; Journal Issue: 2; Journal ID: ISSN 1748-0221
Publisher:
Institute of Physics (IOP)
Country of Publication:
United States
Language:
English
Subject:
72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS; analysis and statistical methods; pattern recognition, cluster finding, calibration and fitting methods

Citation Formats

Rainbolt, J. Lovelace, and Schmitt, M.. The use of minimal spanning trees in particle physics. United States: N. p., 2017. Web. doi:10.1088/1748-0221/12/02/P02009.
Rainbolt, J. Lovelace, & Schmitt, M.. The use of minimal spanning trees in particle physics. United States. doi:10.1088/1748-0221/12/02/P02009.
Rainbolt, J. Lovelace, and Schmitt, M.. Tue . "The use of minimal spanning trees in particle physics". United States. doi:10.1088/1748-0221/12/02/P02009. https://www.osti.gov/servlets/purl/1424587.
@article{osti_1424587,
title = {The use of minimal spanning trees in particle physics},
author = {Rainbolt, J. Lovelace and Schmitt, M.},
abstractNote = {Minimal spanning trees (MSTs) have been used in cosmology and astronomy to distinguish distributions of points in a multi-dimensional space. They are essentially unknown in particle physics, however. We briefly define MSTs and illustrate their properties through a series of examples. We show how they might be applied to study a typical event sample from a collider experiment and conclude that MSTs may prove useful in distinguishing different classes of events.},
doi = {10.1088/1748-0221/12/02/P02009},
journal = {Journal of Instrumentation},
number = 2,
volume = 12,
place = {United States},
year = {Tue Feb 14 00:00:00 EST 2017},
month = {Tue Feb 14 00:00:00 EST 2017}
}

Journal Article:
Free Publicly Available Full Text
Publisher's Version of Record

Save / Share:
  • Algorithms are presented that construct the shortest connecting network, or minimal spanning tree (MST), of N points embedded in k-dimensional coordinate space. These algorithms take advantage of the geometry of such spaces to reduce substantially the computation from that required to construct MST's of more general graphs. An algorithm is also presented that constructs a spanning tree that is very nearly minimal with computation proportional to N log N for all k. 2 figures, 2 tables.
  • In previous works the authors have obtained an effective classification of planar locally minimal binary trees with convex boundaries. The main aim of the present paper is to find more subtle restrictions on the possible structure of such trees in terms of the geometry of the given boundary set. Special attention is given to the case of quasiregular boundaries (that is, boundaries that are sufficiently close to regular ones in a certain sense). In particular, a series of quasiregular boundaries that cannot be spanned by a locally minimal binary tree is constructed.
  • This paper presents a parallel algorithm for constructing depth first spanning trees in planar graphs. The algorithm takes O(log/sup 2/n) time with O(n) processors on a concurrent read concurrent write parallel random access machine (PRAM). The best previously known algorithm for the problem takes O(log/sup 3/n) time with O(n/sup 4/) processors on a PRAM. The authors' algorithm is within an O(log/sup 2/n) factor of optimality.
  • In modeling turbulent reactive flows based on the transport equation for the joint probability density function (jpdf) of velocity and composition, the change in fluid composition due to convection and reaction is treated exactly, while molecular mixing has to be modeled. A new mixing model is proposed, which is local in composition space and which seeks to address problems encountered in flows with simultaneous mixing and reaction. In this model the change in particle composition is determined by particle interactions along the edges of a Euclidean minimum spanning tree (EMST) constructed in composition space. Results obtained for the model problemmore » of passive scalars evolving under the influence of a mean scalar gradient in homogeneous turbulence are found to be in reasonable agreement with experimental findings of Sirivat and Warhaft (1983). The model is applied to the diffusion flame test model problem proposed by Norris and Pope (1991) and its performance is found to be superior to that of existing models. The essential feature of the new EMST mixing model, which accounts for its success in the diffusion flame test, is that mixing is modeled locally in composition space.« less
  • In a previous paper the authors showed that the distributive construction of a spanning tree in a complete network of processors can be done in O(n log n) messages. They show in this work that if the spanning tree is required to satisfy certain properties, then the complexity of its construction increases: First they show that the construction of a minimum weight spanning tree requires, in the worst case, at least ..cap omega..(n/sup 2/) messages, and then they show that the construction of a spanning tree where the maximum degree is at most k may require at least ..cap omega..(n/supmore » 2//k) messages in the worst case. Actually, in both case the lower bounds are shown for the number of edges used in the worst case. Moreover, the results are valid for both asynchronous and synchronous networks, and are independent of the lengths of the messages. On the other hand, there are algorithms for the above tasks which achieve these lower bounds, up to a constant factor, and use messages of O(log n) length.« less