Related papers: Rejection-free cluster Wang-Landau algorithm for h…
Flat histogram methods, such as Wang--Landau sampling, provide a means for high-throughput calculation of phase diagrams of atomistic/lattice model systems. Many parallelisation schemes with varying degrees of complexity have been proposed…
We present a method that can evaluate a RANSAC hypothesis in constant time, i.e. independent of the size of the data. A key observation here is that correct hypotheses are tightly clustered together in the latent parameter domain. In a…
A new algorithm for simulating compact U(1) lattice gauge theory in three dimensions is presented which is based on global changes in the configuration space. We show that this algorithm provides an effective way to extract partition…
We examine a two-dimensional nonequilibrium lattice model where particles adsorb at empty sites and desorb when the number of neighbouring particles is greater than a given threshold. In a certain range of parameters the model exhibits…
We propose a method based on the Wang-Landau algorithm to numerically generate the spectral densities of random matrix ensembles. The method employs Dyson's log-gas formalism for random matrix eigenvalues and also enables one to…
We present a novel, generally applicable Monte Carlo algorithm for the simulation of fluid systems. Geometric transformations are used to identify clusters of particles in such a manner that every cluster move is accepted, irrespective of…
The thermodynamic properties of systems with long-range interactions is still an ongoing challenge, both from the point of view of theory as well as computer simulation. In this work we study a model system, a Coulomb gas confined inside a…
We study finite particle systems on the one-dimensional integer lattice, where each particle performs a continuous-time nearest-neighbour random walk, with jump rates intrinsic to each particle, subject to an exclusion interaction which…
The Logarithmic Linear Relaxation (LLR) algorithm is an efficient method for computing densities of states for systems with a continuous spectrum. A key feature of this method is exponential error reduction, which allows us to evaluate the…
In this paper, we present a cluster algorithm for the simulation of hard spheres and related systems. In this algorithm, a copy of the configuration is rotated with respect to a randomly chosen pivot point. The two systems are then…
We revisit the classical hard-core model, also known as independent set and dual to vertex cover problem, where one puts particles with a first-neighbor hard-core repulsion on the vertices of a random graph. Although the case of random…
While statisticians are well-accustomed to performing exploratory analysis in the modeling stage of an analysis, the notion of conducting preliminary general-purpose exploratory analysis in the Monte Carlo stage (or more generally, the…
We present modified Wang-Landau algorithm for models with continuous degrees of freedom. We demonstrate this algorithm with the calculation of the joint density of states $g(M,E)$ of ferromagnet Heisenberg models. The joint density of…
We present a systematic ab initio study of clustering in hot dilute nuclear matter using nuclear lattice effective field theory with an SU(4)-symmetric interaction. We introduce a method called light-cluster distillation to determine the…
In quantum gas microscopy experiments, reconstructing the site-resolved lattice occupation with high fidelity is essential for the accurate extraction of physical observables. For short interatomic separations and limited signal-to-noise…
We compare the convergence of several flat-histogram methods applied to the 2D Ising model, including the recently introduced stochastic approximation with a dynamic update factor (SAD) method. We compare this method with the Wang-Landau…
Abridged] We present here new results on the space density of rich, optically-selected, clusters of galaxies at low redshift (z<0.15). These results are based on the application of the matched filter cluster-finding algorithm to 1067 deg2…
We present a generalization of the classical Wang-Landau algorithm [Phys. Rev. Lett. 86, 2050 (2001)] to quantum systems. The algorithm proceeds by stochastically evaluating the coefficients of a high temperature series expansion or a…
Using Wang-landau algorithm combined with analytic method, the density of states of two dimensional XY model on square lattices of sizes $16\times16$, $24\times24$ and $32\times32$ is accurately calculated. Thermodynamic quantities, such as…
AIMS. While weak lensing cannot resolve cluster cores and strong lensing is almost insensitive to density profiles outside the scale radius, combinations of both effects promise to constrain density profiles of galaxy clusters well, and…