Papers › Cluster dynamics studied with the phase-space Minimum Spanning Tree approach

Cluster dynamics studied with the phase-space Minimum Spanning Tree approach

18 Mar 2021arXiv:2103.10542links table onlyarchive 2025-07-28

Viktar Kireyeu

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

The origin of weakly bound objects like clusters and hypernuclei, observed in heavy-ion collisions, is of theoretical and experimental interest. It is in the focus of the experiments at RHIC and LHC since it is not evident how such weakly bound objects can survive in an environment whose hadronic decay products point to a temperature of the order of 150 MeV. It is as well one of the key research topics in the future facilities of FAIR and NICA which are under construction in Darmstadt (Germany) and Dubna (Russia), respectively. We present here first results on the cluster dynamics within the model-independent cluster recognition library "phase-space Minimum Spanning Tree" (psMST) applied to different transport approaches: PHQMD, PHSD, SMASH and UrQMD. The psMST is based on the "Minimum Spanning Tree" (MST) algorithm for the cluster recognition which exploits correlations in coordinate space, and it is extended to correlations of baryons in the clusters in momentum space. We show the sensitivity of the cluster formation on the microscopic realization of the n-body dynamics and on the potential interactions in heavy-ion collisions.

PaperPDFCode

Code

gitlab.com/vkireyeu/psmst officialmentioned in papermentioned on GitHub report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections