The use of minimal spanning trees in particle physics

Rainbolt, J. Lovelace; Schmitt, M.

doi:10.1088/1748-0221/12/02/P02009

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:

Rainbolt, J. Lovelace ^[1]; Schmitt, M. ^[1]

Northwestern Univ., Evanston, IL (United States). Dept. of Physics and Astronomy

Publication Date:: Tue Feb 14 00:00:00 EST 2017

Research Org.:: Northwestern Univ., Evanston, IL (United States)

Sponsoring Org.:: USDOE Office of Science (SC), High Energy Physics (HEP)

OSTI Identifier:: 1424587

Grant/Contract Number:: SC0010143

Resource Type:: 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.

Copy to clipboard


                    Rainbolt, J. Lovelace, & Schmitt, M. The use of minimal spanning trees in particle physics.  United States.  https://doi.org/10.1088/1748-0221/12/02/P02009

Copy to clipboard


                    Rainbolt, J. Lovelace, and Schmitt, M. Tue .  
"The use of minimal spanning trees in particle physics".  United States.  https://doi.org/10.1088/1748-0221/12/02/P02009.  https://www.osti.gov/servlets/purl/1424587.

Copy to clipboard


                    
@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}

}

Copy to clipboard

Journal Article:

Free Publicly Available Full Text

Accepted Manuscript (DOE)

Publisher's Version of Record

https://doi.org/10.1088/1748-0221/12/02/P02009

Other availability

Search WorldCat to find libraries that may hold this journal

Citation Metrics:

Cited by: 4 works

Citation information provided by
Web of Science

Save / Share:

Export Metadata

Save to My Library

Works referenced in this record:

The Large Hadron Collider
book, January 2015

Schörner-Sadenius, Thomas
Springer Cham
DOI: 10.1007/978-3-319-15001-7

Minimum Spanning Trees and Single Linkage Cluster Analysis
journal, January 1969

Gower, J. C.; Ross, G. J. S.
Applied Statistics, Vol. 18, Issue 1
DOI: 10.2307/2346439

Shortest Connection Networks And Some Generalizations
journal, November 1957

Prim, R. C.
Bell System Technical Journal, Vol. 36, Issue 6
DOI: 10.1002/j.1538-7305.1957.tb01515.x

On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem
journal, February 1956

Kruskal, Joseph B.
Proceedings of the American Mathematical Society, Vol. 7, Issue 1
DOI: 10.2307/2033241

Minimal spanning trees, filaments and galaxy clustering
journal, September 1985

Barrow, John D.; Bhavsar, Suketu P.; Sonoda, D. H.
Monthly Notices of the Royal Astronomical Society, Vol. 216, Issue 1
DOI: 10.1093/mnras/216.1.17

Minimal spanning tree algorithm for γ-ray source detection in sparse photon images: cluster parameters and selection strategies
journal, May 2013

Campana, R.; Bernieri, E.; Massaro, E.
Astrophysics and Space Science, Vol. 347, Issue 1
DOI: 10.1007/s10509-013-1488-0

Using the minimum spanning tree to trace mass segregation
journal, May 2009

Allison, Richard J.; Goodwin, Simon P.; Parker, Richard J.
Monthly Notices of the Royal Astronomical Society, Vol. 395, Issue 3
DOI: 10.1111/j.1365-2966.2009.14508.x

PYTHIA 6.4 physics and manual
journal, May 2006

Sjöstrand, Torbjörn; Mrenna, Stephen; Skands, Peter
Journal of High Energy Physics, Vol. 2006, Issue 05
DOI: 10.1088/1126-6708/2006/05/026

Works referencing / citing this record:

Beyond two-point statistics: using the minimum spanning tree as a tool for cosmology
journal, November 2019

Naidoo, Krishna; Whiteway, Lorne; Massara, Elena
Monthly Notices of the Royal Astronomical Society, Vol. 491, Issue 2
DOI: 10.1093/mnras/stz3075

MiSTree: a Python package for constructing and analysing Minimum Spanning Trees
journal, October 2019

Naidoo, Krishna
Journal of Open Source Software, Vol. 4, Issue 42
DOI: 10.21105/joss.01721

MiSTree: a Python package for constructing and analysing Minimum Spanning Trees
text, January 2019

Naidoo, Krishna
arXiv
DOI: 10.48550/arxiv.1910.08562

Similar Records in DOE PAGES and OSTI.GOV collections:

Minimal spanning tree algorithm for γ-ray source detection in sparse photon images: cluster parameters and selection strategies

Journal Article Campana, R. ; Bernieri, E. ; Massaro, E. ; ... - Astrophysics and Space Science

We present that the minimal spanning tree (MST) algorithm is a graph-theoretical cluster-finding method. We previously applied it to γ-ray bidimensional images, showing that it is quite sensitive in finding faint sources. Possible sources are associated with the regions where the photon arrival directions clusterize. MST selects clusters starting from a particular “tree” connecting all the point of the image and performing a cut based on the angular distance between photons, with a number of events higher than a given threshold. In this paper, we show how a further filtering, based on some parameters linked to the cluster properties, canmore »« less
Cited by 16
https://doi.org/10.1007/s10509-013-1488-0

Full Text Available
Energy-efficient distributed constructions of miniumum spanning tree for wireless ad-hoc networks

Conference Kumar, V S. A. ; Pandurangan, G ; Khan, M

The Minimum Spanning Tree (MST) problem is one of the most important and commonly occurring primitive in the design and operation of data and communication networks. While there a redistributed algorithms for the MST problem these require relatively large number of messages and time, and are fairly involved, require synchronization and a lot of book keeping; this makes these algorithms impractical for emerging technologies such as ad hoc and sensor networks. In such networks, a sensor has very limited power, and any algorithm needs to be simple, local and energy efficient for being practical. Motivated by these considerations, we studymore »« less
Full Text Available
Fast algorithms for constructing minimal spanning trees in coordinate spaces

Journal Article Bentley, J L ; Friedman, J H - IEEE Trans. Comput.; (United States)

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.
https://doi.org/10.1109/TC.1978.1675043
A single-tree algorithm to compute the Euclidean minimum spanning tree on GPUs

Conference Prokopenko, Andrey ; Sao, Piyush ; Lebrun-Grandie, Damien - Proceedings of the International Conference on Parallel Processing

Computing the Euclidean minimum spanning tree (Emst) is a computationally demanding step of many algorithms. While work-efficient serial and multithreaded algorithms for computing Emst are known, designing an efficient GPU algorithm is challenging due to a complex branching structure, data dependencies, and load imbalances. In this paper, we propose a single-treemore »« less
https://doi.org/10.1145/3545008.3546185

Full Text Available
An extended flow-based formulation for the capacitated minimal spanning tree problem

Conference Gouveia, L

The capacitated minimal spanning tree problem (CMST) is directly related to network design and appears as an important problem, e.g., in the design of local access networks. Previous results with a multicommodity flow formulation indicate that {open_quotes}information{close_quotes} used from a related hop model might be used to design stronger formulations for the CMST. In this talk we present several formulations for the CMST which involve arc variables with a hop index which counts the number of arcs between the root and the corresponding arc. We present an extended single-commodity flow formulation and use previous results to transform the original formulationmore »« less

Similar Records

Title: The use of minimal spanning trees in particle physics

Abstract

Citation Formats

The Large Hadron Collider book, January 2015

Minimum Spanning Trees and Single Linkage Cluster Analysis journal, January 1969

Shortest Connection Networks And Some Generalizations journal, November 1957

On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem journal, February 1956

Minimal spanning trees, filaments and galaxy clustering journal, September 1985

Minimal spanning tree algorithm for γ-ray source detection in sparse photon images: cluster parameters and selection strategies journal, May 2013

Using the minimum spanning tree to trace mass segregation journal, May 2009

PYTHIA 6.4 physics and manual journal, May 2006

Beyond two-point statistics: using the minimum spanning tree as a tool for cosmology journal, November 2019

MiSTree: a Python package for constructing and analysing Minimum Spanning Trees journal, October 2019

MiSTree: a Python package for constructing and analysing Minimum Spanning Trees text, January 2019

The Large Hadron Collider
book, January 2015

Minimum Spanning Trees and Single Linkage Cluster Analysis
journal, January 1969

Shortest Connection Networks And Some Generalizations
journal, November 1957

On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem
journal, February 1956

Minimal spanning trees, filaments and galaxy clustering
journal, September 1985

Minimal spanning tree algorithm for γ-ray source detection in sparse photon images: cluster parameters and selection strategies
journal, May 2013

Using the minimum spanning tree to trace mass segregation
journal, May 2009

PYTHIA 6.4 physics and manual
journal, May 2006

Beyond two-point statistics: using the minimum spanning tree as a tool for cosmology
journal, November 2019

MiSTree: a Python package for constructing and analysing Minimum Spanning Trees
journal, October 2019

MiSTree: a Python package for constructing and analysing Minimum Spanning Trees
text, January 2019