TL;DR
MiSTree is a Python package that efficiently constructs and analyzes Minimum Spanning Trees from point distributions, aiding in extracting non-Gaussian spatial information for cosmology and other fields.
Contribution
It introduces a fast MST construction method using k-nearest neighbors and provides tools for statistical analysis and visualization of MSTs.
Findings
Enables quick MST construction in various coordinate systems.
Facilitates high-order statistical analysis of point distributions.
Applicable in cosmology and other scientific fields.
Abstract
The minimum spanning tree (MST), a graph constructed from a distribution of points, draws lines between pairs of points so that all points are linked in a single skeletal structure that contains no loops and has minimal total edge length. The MST has been used in a broad range of scientific fields such as particle physics (to distinguish classes of events in collider collisions), in astronomy (to detect mass segregation in star clusters) and cosmology (to search for filaments in the cosmic web). Its success in these fields has been driven by its sensitivity to the spatial distribution of points and the patterns within. MiSTree, a public Python package, allows a user to construct the MST in a variety of coordinates systems, including Celestial coordinates used in astronomy. The package enables the MST to be constructed quickly by initially using a k-nearest neighbour graph (kNN, rather…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
