Related papers: Critical properties of the 2D Z(5) vector model
We investigate the critical properties of the two-dimensional Z(5) vector model. For this purpose, we propose a new cluster algorithm, valid for Z(N) models with odd values of N. The two-dimensional Z(5) vector model is conjectured to…
We investigate the critical properties of two-dimensional Z(N) vector models for N larger than 4. In particular, critical points of the two phase transitions are located and some critical indices are determined. We study also the behavior…
We present a novel approach to finding critical points in cell-wise barycentrically or bilinearly interpolated vector fields on surfaces. The Poincar\e index of the critical points is determined by investigating the qualitative behavior of…
We investigate both analytically and numerically the renormalization group equations in 2D Z(N) vector models. The position of the critical points of the two phase transitions for N>4 is established and the critical index \nu\ is computed.…
The invaded cluster algorithm is used to study the XY model in two and three dimensions up to sizes 2000^2 and 120^3 respectively. A soft spin O(2) model, in the same universality class as the 3D XY model, is also studied. The static…
Subspace clustering methods have been widely studied recently. When the inputs are 2-dimensional (2D) data, existing subspace clustering methods usually convert them into vectors, which severely damages inherent structures and relationships…
In computer vision, the estimation of the fundamental matrix is a basic problem that has been extensively studied. The accuracy of the estimation imposes a significant influence on subsequent tasks such as the camera trajectory…
A geometric approach to critical fluctuations of a nonequilibrium model is reported. The two-dimensional majority vote model was investigated by Monte Carlo simulations on square lattices of various sizes and a detailed scaling analysis of…
We present a new computation of the critical value of the random-cluster model with cluster weight $q\ge 1$ on $\mathbb{Z}^2$. This provides an alternative approach to the result of Beffara and Duminil-Copin. We believe that this approach…
Using D-theory we construct a new efficient cluster algorithm for the Ising model. The construction is very different from the standard Swendsen-Wang algorithm and related to worm algorithms. With the new algorithm we have measured the…
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…
In this thesis, we explore the critical phenomena in the presence of extended objects, which we call defects, aiming for a better understanding of the properties of non-local objects ubiquitous in our world and a more practical and…
The dynamic critical behavior of the two-replica cluster algorithm is studied. Several versions of the algorithm are applied to the two-dimensional, square lattice Ising model with a staggered field. The dynamic exponent for the full…
The critical behaviour of the O(n)-symmetric model with two n-vector fields is studied within the field-theoretical renormalization group approach in a D=4-2 epsilon expansion. Depending on the coupling constants the beta-functions, fixed…
Clustering algorithms are one of the main analytical methods to detect patterns in unlabeled data. Existing clustering methods typically treat samples in a dataset as points in a metric space and compute distances to group together similar…
The 1/N expansion for the O(N) vector model in four dimensions is reconsidered. It is emphasized that the effective potential for this model becomes everywhere complex just at the critical point, which signals an unstable vacuum. Thus a…
We have investigated the dynamic critical behavior of the two-dimensional Z(5)-symmetric spin model by using short-time Monte Carlo (MC) simulations. We have obtained estimates of some critical points in its rich phase diagram and included,…
Many cluster similarity indices are used to evaluate clustering algorithms, and choosing the best one for a particular task remains an open problem. We demonstrate that this problem is crucial: there are many disagreements among the…
The exchange or geometric cluster algorithm allows us to define a variance reduced estimator of the connected two-point function in the presence of a broken Z_2-symmetry. We present first numerical tests for the improved Blume-Capel model…
There are various cluster validity indices used for evaluating clustering results. One of the main objectives of using these indices is to seek the optimal unknown number of clusters. Some indices work well for clusters with different…