English
Related papers

Related papers: Formation of fragments in heavy-ion collisions usi…

200 papers

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…

Astrophysics of Galaxies · Physics 2015-05-28 C. Olczak , R. Spurzem , Th. Henning

Given a set of points in the Euclidean plane, the Euclidean \textit{$\delta$-minimum spanning tree} ($\delta$-MST) problem is the problem of finding a spanning tree with maximum degree no more than $\delta$ for the set of points such the…

Combinatorics · Mathematics 2018-09-26 Patrick J. Andersen , Charl J. Ras

The role of momentum correlations is studied in the production of light and medium mass fragments by imposing momentum cut in clusterization the phase space. Our detailed investigation shows that momentum cut has major role to play in the…

Nuclear Theory · Physics 2015-05-27 Sakshi Gautam , Rajni Kant

The yields and velocity distributions of heavy residues and fission fragments from the reaction of 20 MeV/nucleon 197Au + 90Zr have been measured using the MSU A1200 fragment separator. A bimodal distribution of residues is observed, with…

Nuclear Experiment · Physics 2016-09-08 G. A. Souliotis , W. Loveland , K. Hanold , G. J. Wozniak , D. J. Morrissey

We introduce a differentiable clustering method based on stochastic perturbations of minimum-weight spanning forests. This allows us to include clustering in end-to-end trainable pipelines, with efficient gradients. We show that our method…

Machine Learning · Computer Science 2023-11-07 Lawrence Stewart , Francis S Bach , Felipe Llinares López , Quentin Berthet

The minimum degree spanning tree (MDST) problem requires the construction of a spanning tree $T$ for graph $G=(V,E)$ with $n$ vertices, such that the maximum degree $d$ of $T$ is the smallest among all spanning trees of $G$. In this paper,…

Data Structures and Algorithms · Computer Science 2018-06-12 Michael Dinitz , Magnús M. Halldórsson , Calvin Newport

In the Steiner Tree problem we are given an edge weighted undirected graph $G = (V,E)$ and a set of terminals $R \subseteq V$. The task is to find a connected subgraph of $G$ containing $R$ and minimizing the sum of weights of its edges. We…

Data Structures and Algorithms · Computer Science 2026-01-06 Radek Hušek , Dušan Knop , Tomáš Masařík

We present the details of the numerical realization of the recently advanced algorithm developed to identify the fragmentation in heavy ion reactions. This new algorithm is based on the Simulated Annealing method and is dubbed as Simulated…

Nuclear Theory · Physics 2009-10-31 Rajeev K. Puri , Joerg Aichelin

The reduced velocity correlation function for fragments from the reaction Fe + Au at 100 A~MeV bombarding energy is investigated using the dynamical--statistical approach QMD+SMM and compared to experimental data to extract the Freeze--Out…

Nuclear Theory · Physics 2009-10-22 G. Peilert , T. C. Sangster , M. N. Namboodiri , H. C. Britt

The formation of hypernuclei in hadron-induced reactions and in heavy-ion collisions within a combination of a covariant transport model and a statistical fragmentation approach is investigated. We study the applicability and limitations of…

Nuclear Theory · Physics 2015-05-13 T. Gaitanos , H. Lenske , U. Mosel

Utilizing a partitioning method based on equal (or unequal) probabilities -- without incorporating the alpha-cluster ($\alpha$-cluster) model -- allows for the derivation of diverse topological configurations of nuclear fragments resulting…

Nuclear Theory · Physics 2026-04-21 Ting-Ting Duan , Sahanaa Büriechin , Hai-Ling Lao , Fu-Hu Liu , Khusniddin K. Olimov

We use the Boltzmann-Uehling-Uhlenbeck model with a momentum-dependent nuclear mean field to simulate the dynamical evolution of heavy ion collisions. We re-examine the azimuthal anisotropy observable, proposed as sensitive to the equation…

Nuclear Theory · Physics 2009-10-28 Jianming Zhang , Charles Gale

Central nucleus-nucleus collisions produce many new baryons and the nuclear clusters can be formed from these species. The phenomenological coalescence models were sufficiently good for description of light nuclei yields in a very broad…

Nuclear Theory · Physics 2021-06-09 A. S. Botvina , N. Buyukcizmeci , M. Bleicher

Choi et. al (2011) introduced a minimum spanning tree (MST)-based method called CLGrouping, for constructing tree-structured probabilistic graphical models, a statistical framework that is commonly used for inferring phylogenetic trees.…

Combinatorics · Mathematics 2017-01-12 Prabhav Kalaghatgi , Thomas Lengauer

The minimum spanning tree (MST) construction is a classical problem in Distributed Computing for creating a globally minimized structure distributedly. Self-stabilization is versatile technique for forward recovery that permits to handle…

Data Structures and Algorithms · Computer Science 2016-11-25 Lélia Blin , Maria Gradinariu Potop-Butucaru , Stephane Rovedakis , Sébastien Tixeuil

Based on the isospin-dependent quantum molecular dynamics (IQMD) model, we aim to understand the effect of target fragmentation on various quantities i.e. collision rate, fragments multiplicity etc by simulating the collision between…

Nuclear Theory · Physics 2011-12-14 Variderjit Kaur , Bhawna Sharma , Suneel Kumar

Gas-phase oxygen-rich iron oxide clusters Fe(O2)n+ (n=1-6), are produced in a molecular beam apparatus. Their stability and structure are investigated by measuring the fragmentation cross sections from collision-induced-dissociation…

Atomic and Molecular Clusters · Physics 2013-06-26 Michalis Velegrakis , Claudia Mihesan , Maria Jadraque

In the framework of the Statistical Multifragmentation Model, the nuclear isoscaling analysis is extended to constrain the ratio between the sizes of the decaying sources formed in a collision between two heavy ions. It is found that the…

Nuclear Theory · Physics 2022-07-05 S. R. Souza , R. Donangelo , W. G. Lynch , M. B. Tsang

Kesten and Lee [36] proved that the total length of a minimal spanning tree on certain random point configurations in $\mathbb{R}^d$ satisfies a central limit theorem. They also raised the question: how to make these results quantitative?…

Probability · Mathematics 2016-08-09 Sourav Chatterjee , Sanchayan Sen

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…