Related papers: Cluster dynamics studied with the phase-space Mini…
We present a simulation technique to evaluate the most important quantity for nucleation processes: the nucleation barrier, i.e. the free energy of formation of the critical cluster. The method is based on stabilizing a small cluster by…
One of the main challenges for hierarchical clustering is how to appropriately identify the representative points in the lower level of the cluster tree, which are going to be utilized as the roots in the higher level of the cluster tree…
This paper considers the \textit{minimum spanning tree (MST)} problem in the Congested Clique model and presents an algorithm that runs in $O(\log \log \log n)$ rounds, with high probability. Prior to this, the fastest MST algorithm in this…
We present Fast Approximate Minimum Spanning Tree (FAMST), a novel algorithm that addresses the computational challenges of constructing Minimum Spanning Trees (MSTs) for large-scale and high-dimensional datasets. FAMST utilizes a…
The problem of hadronic cluster production in quark-hadron phase transition in heavy-ion collisions is studied by cellular automata. Previous result on the scaling behavior is extended to include variation in the drift speed. It is also…
In the first part of thesis, we shall deal with fragment emission in central collisions studied as a function of beam energy and system mass. Central collisions are also important candidate in view of exploring collective expansion and…
In this paper, we propose a physically inspired graph-theoretical clustering method, which first makes the data points organized into an attractive graph, called In-Tree, via a physically inspired rule, called Nearest Descent (ND). In…
Hierarchical clustering (HC) algorithms are generally limited to small data instances due to their runtime costs. Here we mitigate this shortcoming and explore fast HC algorithms based on random projections for single (SLC) and average…
Data-stream clustering is an ever-expanding subdomain of knowledge extraction. Most of the past and present research effort aims at efficient scaling up for the huge data repositories. Our approach focuses on qualitative improvement, mainly…
Motivated by the fact that distances between data points in many real-world clustering instances are often based on heuristic measures, Bilu and Linial~\cite{BL} proposed analyzing objective based clustering problems under the assumption…
Plastic deformation of crystalline and amorphous matter often involves intermittent local strain burst events. To understand the physical background of the phenomenon a minimal stochastic mesoscopic model was introduced, where…
In this work, we identify and analyse the properties of cluster-cluster filaments within a cosmological simulation assuming that they are structures connecting maxima of the density field defined by dark matter halos with masses $M \, \ge…
The geometric $\delta$-minimum spanning tree problem ($\delta$-MST) is the problem of finding a minimum spanning tree for a set of points in a normed vector space, such that no vertex in the tree has a degree which exceeds $\delta$, and the…
The study of the nuclear equation-of-state (EoS) is a one of the primary goals of experimental and theoretical heavy-ion physics. The comparison of recent high statistics data from the STAR Collaboration with transport models provides a…
Binary neural networks (BNNs) have been widely adopted to reduce the computational cost and memory storage on edge-computing devices by using one-bit representation for activations and weights. However, as neural networks become…
Strongly interacting matter such as nuclear or quark matter leads to few-body bound states and correlations of the constituents. As a consequence quantum chromodynamics has a rich phase structure with spontaneous symmetry breaking,…
The microscopic phasespace approach URQMD is used to investigate the stopping power and particle production in heavy systems at SPS and RHIC energies. This framework bridges with one model consistently the entire available range of energies…
We show that short-range correlations have a dramatic impact on the steady-state phase diagram of quantum driven-dissipative systems. This effect, never observed in equilibrium, follows from the fact that ordering in the steady state is of…
We study statistical and computational limits of clustering when the means of the centres are sparse and their dimension is possibly much larger than the sample size. Our theoretical analysis focuses on the model $X_i = z_i \theta +…
Stochastic programming is widely used for energy system design optimization under uncertainty but can exponentially increase the computational complexity with the number of scenarios. Common scenario reduction techniques, like…