Related papers: The use of Minimal Spanning Tree to characterize t…
Minimum spanning trees (MSTs) provide a convenient representation of datasets in numerous pattern recognition activities. Moreover, they are relatively fast to compute. In this paper, we quantify the extent to which they are meaningful in…
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…
The minimal spanning tree (MST) algorithm is a graph-theoretical cluster-finding method. We previously applied it to gamma-ray bidimensional images, showing that it is quite sensitive in finding faint sources. Possible sources are…
We developed a source detection algorithm based on the Minimal Spanning Tree (MST), that is a graph-theoretical method useful for finding clusters in a given set of points. This algorithm is applied to gamma-ray bidimensional images where…
Analysing the weak lensing distortions of the images of faint background galaxies provides a means to constrain the mass distribution of cluster galaxies and potentially to test the extent of their dark matter halos as a function of the…
Analysing the weak lensing distortions of the images of faint background galaxies provides a means to constrain the average mass distribution of cluster galaxies and potentially to test the extent of their dark matter haloes as a function…
We compare the existent methods including the minimum spanning tree based method and the local stellar density based method, in measuring mass segregation of star clusters. We find that the minimum spanning tree method reflects more the…
Investigations of mass segregation are of vital interest for the understanding of the formation and dynamical evolution of stellar systems on a wide range of spatial scales. Our method is based on the minimum spanning tree (MST) that serves…
We propose and test new statistical tools to study the distribution of cosmic rays based on the use of the Minimal Spanning Tree. The method described is particularly sensitive to filamentary structures, as those expected to arise from…
In this paper, we study the form over the minimum spanning tree problem (MST) from which we will derive an intuitively generalized model and new methods with the upper bound of runtimes of logarithm. The new pattern we made has taken…
We present the topometric MST method to search for clusters of photons in the LAT sky, which was used to obtain the seed list for the compilation of the First LAT catalog. This method works well in non-dense field and can be profitably used…
Weak shear maps of the outer regions of clusters have been successfully used to map the distribution of mass at large radii from the cluster center. The typical smoothing lengths employed thus far preclude the systematic study of the…
The results of the analysis of the subclustering in a sample of ESO Nearby Abell Cluster Survey (ENACS) galaxy clusters, with data complemented from other studies, are presented. The analysis is performed by using the S-tree method enabling…
We use a Minimum Spanning Tree algorithm to characterize the spatial distribution of Galactic Far-IR sources and derive their clustering properties. We aim to reveal the spatial imprint of different types of star forming processes, e.g.…
Consider~\(n\) nodes distributed independently across~\(N\) cities contained with the unit square~\(S\) according to a distribution~\(f.\) Each city is modelled as an~\(r_n \times r_n\) square contained within~\(S\) and~\(MSTC_n\) denotes…
After generalizing the concept of clusters to incorporate clusters that are linked to other clusters through some relatively narrow bridges, an approach for detecting patches of separation between these clusters is developed based on an…
We present the first ROSAC results of an AGN clustering analysis. This study comprises a sample of 200 AGNs, 75% of which being at low redshifts z<0.5, in the Ursa Major constellation. The spatial 2-point-correlation function (SCF) as well…
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.…
Internal measures that are used to assess the quality of a clustering usually take into account intra-group and/or inter-group criteria. There are many papers in the literature that propose algorithms with provable approximation guarantees…
We present a maximum-likelihood analysis of galaxy-galaxy lensing effects in galaxy clusters and in the field. The aim is to determine the accuracy and robustness of constraints that can be obtained on galaxy halo properties in both…