相关论文: A Chiral Phase Transition using a Fermion Cluster …

We examine a model in which a nonequilibrium phase transition from an active to an extinct state is observed. The order of this phase transition has been shown to be either continuous or first-order, depending on the parameter values and…

Ab-initio Monte Carlo simulations of strongly-interacting fermionic systems are plagued by the fermion sign problem, making the non-perturbative study of many interesting regimes of dense quantum matter, or of theories of odd numbers of…

The order of the phase transition in finite-temperature QCD with two degenerate light quarks is still an open problem and corresponds to the last question mark in the zero-density phase diagram of QCD. We argue that establishing the nature…

Consider a two-class clustering problem where we observe $X_i = \ell_i \mu + Z_i$, $Z_i \stackrel{iid}{\sim} N(0, I_p)$, $1 \leq i \leq n$. The feature vector $\mu\in R^p$ is unknown but is presumably sparse. The class labels…

In this paper we present a novel iterative multiphase clustering technique for efficiently clustering high dimensional data points. For this purpose we implement clustering feature (CF) tree on a real data set and a Gaussian density…

We investigate the order of the finite temperature chiral symmetry restoration transition for QCD with two massless fermions, by using a novel method, based on simulating imaginary values of the quark chemical potential…

We present the fermionic universal one--loop effective action obtained by integrating out heavy vector--like fermions at one loop using functional techniques. Even though previous approaches are able to handle integrating out heavy fermions…

Cluster matching by permuting cluster labels is important in many clustering contexts such as cluster validation and cluster ensemble techniques. The classic approach is to minimize the euclidean distance between two cluster solutions which…

Incorporating its most relevant global symmetry, chiral effective models are aimed at investigating, in a simplified framework, important aspects of the yet unsolved QCD. We review some recent results obtained in these models on the…

We discuss some of the computational challenges encountered in simulating the evolution of clusters of galaxies. Eulerian adaptive mesh refinement (AMR) techniques can successfully address these challenges but are currently being used by…

We adapt the VMR (valleys-to-mountains reflections) algorithm, originally devised by us for simulations of SOS models, to the BCSOS model. It is the first time that a cluster algorithm is used for a model with constraints. The performance…

We use Grassmann algebra to study the phase transition in the two-dimensional ferromagnetic Blume-Capel model from a fermionic point of view. This model presents a phase diagram with a second order critical line which becomes first order…

The study of QCD with two light dynamical fermions is of fundamental importance to understand the mechanism of color confinement. We present results of a numerical investigation on the order of the chiral phase transition with $N_f = 2$ by…

Quantum computing is a promising way to systematically solve the longstanding computational problem, the ground state of a many-body fermion system. Many efforts have been made to realise certain forms of quantum advantage in this problem,…

With rapidly increasing data, clustering algorithms are important tools for data analytics in modern research. They have been successfully applied to a wide range of domains; for instance, bioinformatics, speech recognition, and financial…

We describe an adaptive multigrid algorithm for solving inverses of the domain-wall fermion operator. Our multigrid algorithm uses an adaptive projection of near-null vectors of the domain-wall operator onto coarser four-dimensional…

Clustering ensemble has emerged as an important research topic in the field of machine learning. Although numerous methods have been proposed to improve clustering quality, most existing approaches overlook the need for interpretability in…

Numerical simulations of numerous quantum systems suffer from the notorious sign problem. Meron-cluster algorithms lead to an efficient solution of sign problems for both fermionic and bosonic models. Here we apply the meron concept to…

Cluster analysis is one of the essential tasks in data mining and knowledge discovery. Each type of data poses unique challenges in achieving relatively efficient partitioning of the data into homogeneous groups. While the algorithms for…

In finite-size scaling analyses of Monte Carlo simulations of second-order phase transitions one often needs an extended temperature range around the critical point. By combining the parallel tempering algorithm with cluster updates and an…