Related papers: Cluster dynamics studied with the phase-space Mini…
We study cluster and hypernuclei production in heavy-ion collisions at relativistic energies employing the Parton-Hadron-Quantum-Molecular-Dynamics (PHQMD) approach, a microscopic n-body transport model based on the QMD propagation of the…
We study the production of clusters and hypernuclei at midrapidity employing the Parton-Hadron-Quantum-Molecular-Dynamics (PHQMD) approach, a microscopic n-body transport model based on the QMD propagation of the baryonic degrees of freedom…
Cluster and hypernuclei production in heavy-ion collisions is presently under active experimental and theoretical investigation. Since clusters are weekly bound objects, their production is very sensitive to the dynamical evolution of the…
A new open-source cluster finding library ''Common Clusterization Library'' (CCL) is proposed to describe the clusters production when applied to the transport codes. The new library was applied to the Parton-Hadron-Quantum-Molecular…
We investigate light cluster and anti-cluster production in heavy-ion collisions from SIS to RHIC energies within the Parton-Hadron-Quantum-Molecular Dynamics (PHQMD) microscopic transport approach which propagates (anti-)baryons using…
We present the novel microscopic n-body dynamical transport approach PHQMD(Parton-Hadron-Quantum-Molecular-Dynamics) for the description of particle production and cluster formation in heavy-ion reactions at relativistic energies. The PHQMD…
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…
Modeling of the process of the formation of nuclear clusters in the hot nuclear matter is a challenging task. We present the novel n-body dynamical transport approach - PHQMD (Parton-Hadron-Quantum-Molecular Dynamics) [1] for the…
A review is given on the studies of formation of light clusters and heavier fragments in heavy-ion collisions at incident energies from several tens of MeV/nucleon to several hundred MeV/nucleon, focusing on dynamical aspects and on…
The formation of deuterons in heavy-ion collisions at relativistic energies is investigated by employing two recently advanced models -- the Minimum Spanning Tree (MST) method and the coalescence model by embedding them in the PHQMD and the…
When dense granular gases are continuously excited under microgravity conditions, spatial inhomogeneities of the particle number density can emerge. A significant share of particles may collect in strongly overpopulated regions, called…
Most of the existing clustering methods are based on a single granularity of information, such as the distance and density of each data. This most fine-grained based approach is usually inefficient and susceptible to noise. Therefore, we…
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.…
Metal clusters are partway between molecular and bulk systems and thus exhibit special physical and chemical properties. Atoms can rearrange within a cluster to form different structural isomers. Internal degrees of freedom and the…
Perturbing fluids of neutrons and protons (nuclear matter) may lead, as the most catastrophic effect, to the rearrangement of the fluid into clusters of nucleons. A similar process may occur in a single atomic nucleus undergoing a violent…
This mini-review summarizes the general setup and some highlight results from the hadronic transport approach SMASH (Simulating Many Accelerated Strongly-interacting Hadrons). We start by laying out the software development structures as…
Minijets provide useful information on parton interactions in the low transverse-momentum (low-$p_T$) region. Because minijets produce clusters, we study the clustering properties of produced particles in high-energy $pp$ collisions as a…
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…
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…
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…