Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:hep-lat/9704009 · Springer eBooks

Cluster algorithms

Ferenc Niedermayer A

Published Apr 7, 2008• 4 citations
arXivHTMLPDF
DOI
10.1007/bfb0105458

Related papers

Documents clustering using quantum clustering algorithm

Rupam Bhagawati, Sahinur Rahman Laskar, Bhagaban Swain

In the domain of Quantum Information processing (QIP), quantum clustering approach plays a vital role for processing information. The quantum clustering technique is basically used for providing effective information navigation and browsing mechanism. There are many classical approach of clustering the documents like k-means clustering algorithm, hierarchical clustering algorithm, information bottleneck clustering algorithm and many more. In this paper we proposed a clustering method which is based on quantum theory. For clustering the documents, such that which provides an agreeable result in comparison of existing classical approach.

International Conference on Microelectronics, Computing and Communications•Jan 1, 2016•3 citations

Framework and properties of cluster algorithms

Werner Kerler A

Nuclear Physics B - Proceedings Supplements•Mar 1, 1993•2 citations

Dual Monte Carlo and cluster algorithms

Naoki Kawashima, James E. Gubernatis

We discuss the development of cluster algorithms from the viewpoint of probability theory and not from the usual viewpoint of a particular model. From the viewpoint of probability theory, we detail the nature of a cluster algorithm, make explicit the assumptions embodied in all clusters of which we are aware, and define the construction of free-cluster algorithms. We also illustrate these procedures by rederiving the Swendsen-Wang algorithm, presenting the details of the loop algorithm for a worldline simulation of a quantum S=1/2 model, and proposing a free-cluster version of the Swendsen-Wang replica method for the random Ising model. How the principle of maximum entropy might be used to aid the construction of cluster algorithms is also discussed.

arXiv:cond-mat/9411110•Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics•Feb 1, 1995•45 citations

Efficient cluster algorithm for models

Bernard B. Beard, Michele Pepe A, S. Riederer +1 more

arXiv:hep-lat/0602018•Computer Physics Communications•Sep 27, 2006•9 citations

Single-cluster dynamics for the random-cluster model

Youjin Deng, Xiaofeng Qian, Henk W. J. Blöte

We formulate a single-cluster Monte Carlo algorithm for the simulation of the random-cluster model. This algorithm is a generalization of the Wolff single-cluster method for the q-state Potts model to noninteger values q>1. Its results for static quantities are in a satisfactory agreement with those of the existing Swendsen-Wang-Chayes-Machta (SWCM) algorithm, which involves a full-cluster decomposition of random-cluster configurations. We explore the critical dynamics of this algorithm for several two-dimensional Potts and random-cluster models. For integer q, the single-cluster algorithm can be reduced to the Wolff algorithm, for which case we find that the autocorrelation functions decay almost purely exponentially, with dynamic exponents z(exp)=0.07 (1), 0.521 (7), and 1.007 (9) for q=2, 3, and 4, respectively. For noninteger q, the dynamical behavior of the single-cluster algorithm appears to be very dissimilar to that of the SWCM algorithm. For large critical systems, the autocorrelation function displays a range of power-law behavior as a function of time. The dynamic exponents are relatively large. We provide an explanation for this peculiar dynamic behavior.

arXiv:0907.1711•Physical Review E•Sep 30, 2009•5 citations

On clustering property

Huzihiro Araki, Akitaka Kishimoto

Reports on Mathematical Physics•Oct 1, 1976•5 citations
In the domain of Quantum Information processing (QIP), quantum clustering approach plays a vital role for processing information. The quantum clustering technique is basically used for providing effective information navigation and browsing mechanism. There are many classical approach of clustering the documents like k-means clustering algorithm, hierarchical clustering algorithm, information bottleneck clustering algorithm and many more. In this paper we proposed a clustering method which is based on quantum theory. For clustering the documents, such that which provides an agreeable result in comparison of existing classical approach.
We discuss the development of cluster algorithms from the viewpoint of probability theory and not from the usual viewpoint of a particular model. From the viewpoint of probability theory, we detail the nature of a cluster algorithm, make explicit the assumptions embodied in all clusters of which we are aware, and define the construction of free-cluster algorithms. We also illustrate these procedures by rederiving the Swendsen-Wang algorithm, presenting the details of the loop algorithm for a worldline simulation of a quantum S=1/2 model, and proposing a free-cluster version of the Swendsen-Wang replica method for the random Ising model. How the principle of maximum entropy might be used to aid the construction of cluster algorithms is also discussed.
We formulate a single-cluster Monte Carlo algorithm for the simulation of the random-cluster model. This algorithm is a generalization of the Wolff single-cluster method for the q-state Potts model to noninteger values q>1. Its results for static quantities are in a satisfactory agreement with those of the existing Swendsen-Wang-Chayes-Machta (SWCM) algorithm, which involves a full-cluster decomposition of random-cluster configurations. We explore the critical dynamics of this algorithm for several two-dimensional Potts and random-cluster models. For integer q, the single-cluster algorithm can be reduced to the Wolff algorithm, for which case we find that the autocorrelation functions decay almost purely exponentially, with dynamic exponents z(exp)=0.07 (1), 0.521 (7), and 1.007 (9) for q=2, 3, and 4, respectively. For noninteger q, the dynamical behavior of the single-cluster algorithm appears to be very dissimilar to that of the SWCM algorithm. For large critical systems, the autocorrelation function displays a range of power-law behavior as a function of time. The dynamic exponents are relatively large. We provide an explanation for this peculiar dynamic behavior.