$\mathcal{Q}^{+}$: Characterising the structure of young star clusters
S. E. Jaffa, A. P. Whitworth, O. Lomax

TL;DR
This paper introduces a new statistical algorithm to analyze and quantify the fractal sub-structure of young star clusters, characterizing their hierarchical complexity through three key parameters.
Contribution
The paper presents a novel algorithm that accurately constrains the fractal dimension, hierarchy levels, and density scaling of star clusters from observational data.
Findings
The algorithm reliably recovers 3D structure from 2D projections.
It quantifies the diversity of structures in real and simulated clusters.
The method advances understanding of star cluster formation and structure.
Abstract
Many young star clusters appear to be fractal, i.e. they appear to be concentrated in a nested hierarchy of clusters within clusters. We present a new algorithm for statistically analysing the distribution of stars to quantify the level of sub-structure. We suggest that, even at the simplest level, the internal structure of a fractal cluster requires the specification of three parameters. (i) The 3D fractal dimension, , measures the extent to which the clusters on one level of the nested hierarchy fill the volume of their parent cluster. (ii) The number of levels, , reflects the finite ratio between the linear size of the large root-cluster at the top of the hierarchy, and the smallest leaf-clusters at the bottom of the hierarchy. (iii) The volume-density scaling exponent, measures the factor by which the…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
