2009
DOI: 10.1111/j.1365-2966.2009.14508.x
|View full text |Cite
|
Sign up to set email alerts
|

Using the minimum spanning tree to trace mass segregation

Abstract: We present a new method to detect and quantify mass segregation in star clusters. It compares the minimum spanning tree (MST) of massive stars with that of random stars. If mass segregation is present, the MST length of the most massive stars will be shorter than that of random stars. This difference can be quantified (with an associated significance) to measure the degree of mass segregation. We test the method on simulated clusters in both 2D and 3D and show that the method works as expected. We apply the … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

6
307
1

Year Published

2010
2010
2017
2017

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 231 publications
(314 citation statements)
references
References 26 publications
6
307
1
Order By: Relevance
“…Because the sensitivity of the MST to the completeness of a sample is not fully understood (Allison et al 2009), we cannot draw firm conclusions. We note however that two independent methods, profile fitting and MST analysis, both point towards mass segregation, as can be expected for the most massive stars in such a cluster.…”
Section: Mass Segregationmentioning
confidence: 98%
“…Because the sensitivity of the MST to the completeness of a sample is not fully understood (Allison et al 2009), we cannot draw firm conclusions. We note however that two independent methods, profile fitting and MST analysis, both point towards mass segregation, as can be expected for the most massive stars in such a cluster.…”
Section: Mass Segregationmentioning
confidence: 98%
“…A statistical method to probe spatial compactness is the minimum spanning tree (MST) method (Prim 1957). This (see also Allison et al 2009;Parker et al 2011) consists in computing the minimum path-length required to connect all points of a given sample in a network of direct point-to-point links with no closed loops. Shorter MST lengths will thus identify, to a certain degree of confidence, more compact populations.…”
Section: A Spatial Mapping Of Accretion Properties In Ngc 2264mentioning
confidence: 99%
“…As a proxy for mass segregation we extend the method M Λ MST developed by Allison et al (2009b) (see also Cartwright & Whitworth 2004;Schmeja & Klessen 2006). In summary, the authors use the minimum spanning tree (MST), the graph which connects all vertices within a given sample with the lowest possible sum of edges and no closed loops (Gower & Ross 1969).…”
Section: Geometrical Minimum Spanning Tree γ Mstmentioning
confidence: 99%
“…Our method M Γ MST involves two crucial modifications of M Λ MST that make it computationally much more effective and boost its sensitivity. First, unlike Allison et al (2009b) we do not calculate the separations between all possible pairs of stars but determine the MST (in two dimensions) in a three-step procedure: first we use a 2D Delaunay triangulation (from the software package GEOMPACK: Joe 1991) to construct a useful graph of stellar positions projected onto a plane, then we sort the edges of the triangles in ascending order, and finally adapt Kruskal's algorithm (Kruskal 1956) with an efficient union-find-algorithm to construct the MST.…”
Section: Geometrical Minimum Spanning Tree γ Mstmentioning
confidence: 99%
See 1 more Smart Citation