Related papers: Mean Field Behavior of Cluster Dynamics
In this paper, we develop a Mean Field Games approach to Cluster Analysis. We consider a finite mixture model, given by a convex combination of probability density functions, to describe the given data set. We interpret a data point as an…
Monte Carlo simulations are performed in classical phase space for a one-dimensional quantum harmonic crystal. Symmetrization effects for spinless bosons and fermions are quantified. The algorithm is tested for a range of parameters against…
Most classification methods are based on the assumption that data conforms to a stationary distribution. The machine learning domain currently suffers from a lack of classification techniques that are able to detect the occurrence of a…
Collective motion in animal groups, such as swarms of insects, flocks of birds, and schools of fish, are some of the most visually striking examples of emergent behavior. Empirical analysis of these behaviors in experiment or computational…
Motivated by considerations from neuroscience (macroscopic behavior of large ensembles of interacting neurons), we consider a population of mean field interacting diffusions in $\mathbf {R}^m$ in the presence of a random environment and…
We show that model-based Bayesian clustering, the probabilistically most systematic approach to the partitioning of data, can be mapped into a statistical physics problem for a gas of particles, and as a result becomes amenable to a…
We consider the problem of estimating the measure of subsets in very large networks. A prime tool for this purpose is the Markov Chain Monte Carlo (MCMC) algorithm. This algorithm, while extremely useful in many cases, still often suffers…
Motivated by the physics of strings and branes, we introduce a general suite of Markov chain Monte Carlo (MCMC) "suburban samplers" (i.e., spread out Metropolis). The suburban algorithm involves an ensemble of statistical agents connected…
We propose a computationally simple framework for clustering functional data based on Gaussian-process-generated random projections. In this approach, each curve is first projected onto a large collection of independent Gaussian process…
We introduce a new and very convenient approach to multi-grid Monte Carlo (MGMC) algorithms for general nonlinear $\sigma$-models: it is based on embedding an $XY$ model into the given $\sigma$-model, and then updating the induced $XY$…
The concept of sample mean in dynamic time warping (DTW) spaces has been successfully applied to improve pattern recognition systems and generalize centroid-based clustering algorithms. Its existence has neither been proved nor challenged.…
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…
We study crossover phenomena in a model of self-avoiding walks with medium-range jumps, that corresponds to the limit $N\to 0$ of an $N$-vector spin system with medium-range interactions. In particular, we consider the critical crossover…
Recently, the present authors proposed the nonequilibrium-to-equilibrium scaling (NE-ES) scheme for critical Monte Carlo relaxation process, which scales relaxation data in the whole simulation-time regions regardless of functional forms,…
We propose a cluster simulation algorithm for statistical ensembles with fixed order parameter. We use the tethered ensemble, which features Helmholtz's effective potential rather than Gibbs's free energy, and in which canonical averages…
We applied a mean-field approach associated to Monte Carlo simulations in order to study the spin-1 ferromagnetic Blume-Capel model in the square and the linear lattice. This new technique, which we call MFT-MC, determines the molecular…
In simulations of some infinite range spin glass systems with finite connectivity, it is found that for any resonable computational time, the saturatedenergy per spin that is achieved by a cluster algorithm is lowered in comparison to that…
Quantum spin systems with strong geometric restrictions give rise to rich quantum phases such as valence bond solids and spin liquid states. However, the geometric restrictions often hamper the application of sophisticated numerical…
Collective behavior is studied in globally coupled maps. Several coherent motions exist, even in fully desynchronized state. To characterize the collective behavior, we introduce scaling transformation of parameter, and detect the…
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…