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

CRC Press eBooks

Cluster model in the correlated Gaussian approach

Published Feb 6, 2003• 0 citations
Publisher
DOI
10.1201/9780203168271.ch12

Related papers

Geometrical clusters in two-dimensional random-field Ising models

László Környei, Ferenc Iglói

We consider geometrical or Ising clusters (i.e., domains of parallel spins) in the square lattice random-field Ising model by varying the strength of the Gaussian random field $\ensuremath{\Delta}$. In agreement with the conclusion of a previous investigation [Phys. Rev. E 63, 066109 (2001)], the geometrical correlation length, i.e., the average size of the clusters $\ensuremath{\xi}$ is finite for $\ensuremath{\Delta}>{\ensuremath{\Delta}}_{c}\ensuremath{\approx}1.65$ and divergent for $\ensuremath{\Delta}\ensuremath{\leqslant}{\ensuremath{\Delta}}_{c}$. The scaling function of the distribution of the mass of the clusters as well as the geometrical correlation function are found to involve the scaling exponents of critical percolation. On the other hand, the divergence of the correlation length, $\ensuremath{\xi}(\ensuremath{\Delta})\ensuremath{\sim}{(\ensuremath{\Delta}\ensuremath{-}{\ensuremath{\Delta}}_{c})}^{\ensuremath{-}\ensuremath{\nu}}$, with $\ensuremath{\nu}\ensuremath{\approx}2$, is related to that of tricritical percolation. It is verified numerically that critical geometrical correlations transform conformally.

arXiv:cond-mat/0610110•Physical Review E•Jan 29, 2007•15 citations

Cluster Monte Carlo: Extending the range

Henk W. J. Blöte, Jouke R. Heringa, Erik Luijten

Computer Physics Communications•Aug 1, 2002•22 citations

Statics and dynamics of the ten-state nearest-neighbour Potts glass on the simple-cubic lattice

Claudio Brangian, Walter Kob, Kurt Binder

We present the results of Monte Carlo simulations of two different three-dimensional-Potts glass models with short-range random interactions. In the first model, a ± J -distribution of the bonds is chosen, in the second model a Gaussian distribution. In both cases, the first two moments of the distribution are chosen to be J 0 = −1, Δ J = +1, so that no ferromagnetic ordering of the Potts spins can occur. We find that for all temperatures investigated the spin glass susceptibility remains finite, that the spin glass order parameter remains zero, and that the specific heat has only a smooth Schottky-like peak. These results can be understood quantitatively by considering small but independent clusters of spins. Hence, we have evidence that there is no static phase transition at any nonzero temperature. Consistent with these findings, only very minor size effects are observed, which implies that all correlation lengths of the models remain very short. We also compute for both models the time auto-correlation function C ( t ) of the Potts spins. While in the Gaussian model C ( t ) shows a smooth uniform decay, the correlator for the ± J model has several distinct steps. These steps correspond to the breaking of bonds in small clusters of ferromagnetically coupled spins (dimers, trimers, etc). The relaxation times follow simple Arrhenius laws, with activation energies that are readily interpreted within the cluster picture, giving evidence that the system does not have a dynamic transition at a finite temperature. Hence we find that for the present models, all the transitions known for the mean-field version of the model are completely wiped out. Finally, we also determine the time auto-correlation functions of individual spins, and show that the system is dynamically very heterogeneous.

arXiv:cond-mat/0211195•Journal of Physics A Mathematical and General•Oct 15, 2003•22 citations

Framework and properties of cluster algorithms

Werner Kerler A

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

Cluster Expansion for Random Systems

Hiroshi Ueyama

Progress of Theoretical Physics•May 1, 1969•1 citation

Point processes with Gaussian boson sampling

Soran Jahangiri, Juan Miguel Arrazola, Nicolás Quesada +1 more

Random point patterns are ubiquitous in nature, and statistical models such as point processes, i.e., algorithms that generate stochastic collections of points, are commonly used to simulate and interpret them. We propose an application of quantum computing to statistical modeling by establishing a connection between point processes and Gaussian boson sampling, an algorithm for photonic quantum computers. We show that Gaussian boson sampling can be used to implement a class of point processes based on hard-to-compute matrix functions which, in general, are intractable to simulate classically. We also discuss situations where polynomial-time classical methods exist. This leads to a family of efficient quantum-inspired point processes, including a fast classical algorithm for permanental point processes. We investigate the statistical properties of point processes based on Gaussian boson sampling and reveal their defining property: like bosons that bunch together, they generate collections of points that form clusters. Finally, we analyze properties of these point processes for homogeneous and inhomogeneous state spaces, describe methods to control cluster location, and illustrate how to encode correlation matrices.

arXiv:1906.11972•Physical review. E•Feb 28, 2020•45 citations
We consider geometrical or Ising clusters (i.e., domains of parallel spins) in the square lattice random-field Ising model by varying the strength of the Gaussian random field $\ensuremath{\Delta}$. In agreement with the conclusion of a previous investigation [Phys. Rev. E 63, 066109 (2001)], the geometrical correlation length, i.e., the average size of the clusters $\ensuremath{\xi}$ is finite for $\ensuremath{\Delta}>{\ensuremath{\Delta}}_{c}\ensuremath{\approx}1.65$ and divergent for $\ensuremath{\Delta}\ensuremath{\leqslant}{\ensuremath{\Delta}}_{c}$. The scaling function of the distribution of the mass of the clusters as well as the geometrical correlation function are found to involve the scaling exponents of critical percolation. On the other hand, the divergence of the correlation length, $\ensuremath{\xi}(\ensuremath{\Delta})\ensuremath{\sim}{(\ensuremath{\Delta}\ensuremath{-}{\ensuremath{\Delta}}_{c})}^{\ensuremath{-}\ensuremath{\nu}}$, with $\ensuremath{\nu}\ensuremath{\approx}2$, is related to that of tricritical percolation. It is verified numerically that critical geometrical correlations transform conformally.
We present the results of Monte Carlo simulations of two different three-dimensional-Potts glass models with short-range random interactions. In the first model, a ± J -distribution of the bonds is chosen, in the second model a Gaussian distribution. In both cases, the first two moments of the distribution are chosen to be J 0 = −1, Δ J = +1, so that no ferromagnetic ordering of the Potts spins can occur. We find that for all temperatures investigated the spin glass susceptibility remains finite, that the spin glass order parameter remains zero, and that the specific heat has only a smooth Schottky-like peak. These results can be understood quantitatively by considering small but independent clusters of spins. Hence, we have evidence that there is no static phase transition at any nonzero temperature. Consistent with these findings, only very minor size effects are observed, which implies that all correlation lengths of the models remain very short. We also compute for both models the time auto-correlation function C ( t ) of the Potts spins. While in the Gaussian model C ( t ) shows a smooth uniform decay, the correlator for the ± J model has several distinct steps. These steps correspond to the breaking of bonds in small clusters of ferromagnetically coupled spins (dimers, trimers, etc). The relaxation times follow simple Arrhenius laws, with activation energies that are readily interpreted within the cluster picture, giving evidence that the system does not have a dynamic transition at a finite temperature. Hence we find that for the present models, all the transitions known for the mean-field version of the model are completely wiped out. Finally, we also determine the time auto-correlation functions of individual spins, and show that the system is dynamically very heterogeneous.
Random point patterns are ubiquitous in nature, and statistical models such as point processes, i.e., algorithms that generate stochastic collections of points, are commonly used to simulate and interpret them. We propose an application of quantum computing to statistical modeling by establishing a connection between point processes and Gaussian boson sampling, an algorithm for photonic quantum computers. We show that Gaussian boson sampling can be used to implement a class of point processes based on hard-to-compute matrix functions which, in general, are intractable to simulate classically. We also discuss situations where polynomial-time classical methods exist. This leads to a family of efficient quantum-inspired point processes, including a fast classical algorithm for permanental point processes. We investigate the statistical properties of point processes based on Gaussian boson sampling and reveal their defining property: like bosons that bunch together, they generate collections of points that form clusters. Finally, we analyze properties of these point processes for homogeneous and inhomogeneous state spaces, describe methods to control cluster location, and illustrate how to encode correlation matrices.