Related papers: A Cluster Algorithm for the $Z_2$ Kalb-Ramond Mode…
Using high precision Monte Carlo simulations and a mean-field theory, we explore coarsening phenomena in a simple driven diffusive system. The model is reminiscent of vehicular traffic on a two-lane ring road. At sufficiently high density,…
A simple ``brute-force'' parallelisation procedure for the computational implementation of high-order coupled cluster method (CCM) calculations is presented here. This approach is investigated and illustrated by an application of high-order…
In this paper, we investigate the convergence speed of the Arimoto-Blahut algorithm. For many channel matrices the convergence is exponential, but for some channel matrices it is slower than exponential. By analyzing the Taylor expansion of…
The capability of classifying and clustering a desired set of data is an essential part of building knowledge from data. However, as the size and dimensionality of input data increases, the run-time for such clustering algorithms is…
The proposed distributed dynamic clustering algorithm enables to group agents based on their pre-selected feature states. The clusters are determined by comparing the distance of the agents' current feature states with average estimates of…
We present a low-complexity algorithm to calculate the correlation energy of periodic systems in second-order M\o ller-Plesset perturbation theory (MP2). In contrast to previous approximation-free MP2 codes, our implementation possesses a…
The recent solution to the fermion sign problem allows, for the first time, the use of cluster algorithm techniques to compute certain fermionic path integrals. To illustrate the underlying ideas behind the progress, a cluster algorithm is…
This paper presents a novel algorithm, based upon the dependent Dirichlet process mixture model (DDPMM), for clustering batch-sequential data containing an unknown number of evolving clusters. The algorithm is derived via a low-variance…
Blockchain transaction data exhibits high dimensionality, noise, and intricate feature entanglement, presenting significant challenges for traditional clustering algorithms. In this study, we conduct a comparative analysis of three…
Clustering is one of the most important tools for analysis of large datasets, and perhaps the most popular clustering algorithm is Lloyd's algorithm for $k$-means. This algorithm takes $n$ vectors $V=[v_1,\dots,v_n]\in\mathbb{R}^{d\times…
Second-order Moller-Plesset perturbation theory (MP2) for ab initio simulations of solids is often limited by divergence or over-correlation issues, particularly in metallic, narrow-gap, and dispersion-stabilized systems. We develop and…
A model for quantum tunnelling of a cluster comprising A identical particles, coupled by oscillator-type potential, through short-range repulsive potential barriers is introduced for the first time in the new symmetrized-coordinate…
In the rapidly evolving world of financial markets, understanding the dynamics of limit order book (LOB) is crucial for unraveling market microstructure and participant behavior. We introduce ClusterLOB as a method to cluster individual…
We report on the development of two dual worm constructions that lead to cluster algorithms for efficient and ergodic Monte Carlo simulations of frustrated Ising models with arbitrary two-spin interactions that extend up to third-neighbours…
This work addresses the challenge of learning reduced-order models (ROMs) capable of generalizing to unobserved dynamical regimes across unseen control parameters. We introduce the Control-oriented Cluster-based Network Model (CNMc), a…
We consider spectral clustering algorithms for community detection under a general bipartite stochastic block model (SBM). A modern spectral clustering algorithm consists of three steps: (1) regularization of an appropriate adjacency or…
We discuss the analytic computation of autocorrelation functions for the generalized Hybrid Monte Carlo algorithm applied to free field theory and compare the results with numerical results for the $O(4)$ spin model in two dimensions. We…
We present a simplified dynamical model of the ``Bullet'' system of two colliding clusters. The model constrains the masses of the system by requiring that the orbits of the main and sub components satisfy the cosmological initial…
We present a study on how to effectively reduce the dimensions of the $k$-means clustering problem, so that provably accurate approximations are obtained. Four algorithms are presented, two \textit{feature selection} and two \textit{feature…
In the realm of big data, discerning patterns in nonlinear systems affected by external control inputs is increasingly challenging. Our approach blends the coarse-graining strengths of centroid-based unsupervised clustering with the clarity…