Related papers: A Chiral Phase Transition using a Fermion Cluster …
When faced with high frequency streams of data, clustering raises theoretical and algorithmic pitfalls. We introduce a new and adaptive online clustering algorithm relying on a quasi-Bayesian approach, with a dynamic (i.e., time-dependent)…
The EM algorithm is one of many important tools in the field of statistics. While often used for imputing missing data, its widespread applications include other common statistical tasks, such as clustering. In clustering, the EM algorithm…
We investigate the sign problem of the fermion determinant at finite baryon density in (1+1) dimensions, in which the ground state in the chiral limit should be free from the sign problem by forming a chiral spiral. To confirm it, we…
Three possibilities to speed up the Hybrid Monte Carlo algorithm are investigated. Changing the step-size adaptively brings no practical gain. On the other hand, substantial improvements result from using an approximate Hamiltonian or a…
A novel framework for consensus clustering is presented which has the ability to determine both the number of clusters and a final solution using multiple algorithms. A consensus similarity matrix is formed from an ensemble using multiple…
AI-enabled precision medicine promises a transformational improvement in healthcare outcomes by enabling data-driven personalized diagnosis, prognosis, and treatment. However, the well-known "curse of dimensionality" and the clustered…
A hierarchical scheme for clustering data is presented which applies to spaces with a high number of dimension ($N_{_{D}}>3$). The data set is first reduced to a smaller set of partitions (multi-dimensional bins). Multiple clustering…
Almost all of the most successful quantum algorithms discovered to date exploit the ability of the Fourier transform to recover subgroup structure of functions, especially periodicity. The fact that Fourier transforms can also be used to…
Handling clustering problems are important in data statistics, pattern recognition and image processing. The mean-shift algorithm, a common unsupervised algorithms, is widely used to solve clustering problems. However, the mean-shift…
The most efficient known quantum circuits for preparing unitary coupled cluster states and applying Trotter steps of the arbitrary basis electronic structure Hamiltonian involve interleaved sequences of fermionic Gaussian circuits and Ising…
Diagrammatic Monte Carlo approach is applied to a problem of a single spin-down fermion resonantly interacting with the sea of ideal spin-up fermions. On one hand, we develop a generic, sign-problem tolerant, method of exact numerical…
We propose an efficient procedure for determining phase diagrams of systems that are described by spin models. It consists of combining cluster algorithms with the method proposed by Sauerwein and de Oliveira where the grand canonical…
In this paper a variant of the classical hierarchical cluster analysis is reported. This agglomerative (bottom-up) cluster technique is referred to as the Adaptive Mean-Linkage Algorithm. It can be interpreted as a linkage algorithm where…
We demonstrate that a series of procedures for increasing the efficiency of transition matrix calculations can be realized by integrating the standard single-spin flip transition matrix method with global cluster flipping techniques. Our…
In this brief paper, we go through the theoretical steps of the spectral clustering on quantum computers by employing the phase estimation and the amplitude amplification algorithms. We discuss circuit designs for each step and show how to…
A general algorithm toward the solution of the fermion sign problem in finite-temperature quantum Monte Carlo simulations has been formulated for discretized fermion path integrals with nearest-neighbor interactions in the Trotter…
Distributed data mining techniques and mainly distributed clustering are widely used in the last decade because they deal with very large and heterogeneous datasets which cannot be gathered centrally. Current distributed clustering…
Nature of the phase transition of regularly frustrated vector spin systems in three dimensions is investigated based on a Ginzburg-Landau-type effective Hamiltonian. On the basis of the variational analysis of this model, Onoda et al…
The Vicsek model, which was originally proposed to explain the dynamics of bird flocking, exhibits a phase transition with respect to the absolute value of the mean velocity. Although clusters of agents can be easily observed via numerical…
The three-dimensional four-fermion model with a Z_2 chiral symmetry and N=4 fermion species in the system is investigated numerically at non-zero temparature and chemical potential. The phase diagram in the (chemical potential, temperature)…