Related papers: Parallelizing Wang-Landau algorithm in the field: …
High-dimensional limit theorems have been shown useful to derive tuning rules for finding the optimal scaling in random-walk Metropolis algorithms. The assumptions under which weak convergence results are proved are however restrictive: the…
Generally, the local interactions in a many-body quantum spin system on a lattice do not commute with each other. Consequently, the Hamiltonian of a local region will generally not commute with that of the entire system, and so the two…
Finding an energy minimum in the Ising model is an exemplar objective, associated with many combinatorial optimization problems, that is computationally hard in general, but occurs in all areas of modern science. There are several numerical…
Community detection, as well as the identification of other structures like core periphery and disassortative patterns, is an important topic in network analysis. While most methods seek to find the best partition of the network according…
Using extensive Monte Carlo simulations, we study the interface localization- delocalization transition of a thin Ising film with antisymmetric competing walls for a set of parameters where the transition is strongly first-order. This is…
We propose a decentralized subspace algorithm for identification of large-scale, interconnected systems that are described by sparse (multi) banded state-space matrices. First, we prove that the state of a local subsystem can be…
We present a study on the performance of Wang-Landau algorithm in a lattice model of liquid crystals which is a continuous lattice spin model. We propose a novel method of the spin update scheme in a continuous lattice spin model. The…
Random matrix ensembles are introduced that respect the local tensor structure of Hamiltonians describing a chain of $n$ distinguishable spin-half particles with nearest-neighbour interactions. We prove a central limit theorem for the…
In this communication, the convergence of the 1/t and Wang - Landau algorithms in the calculation of multidimensional numerical integrals is analyzed. Both simulation methods are applied to a wide variety of integrals without restrictions…
This paper is devoted to computational algorithms designed to describe the classical Ising magnet in some specific cases when an additional macroscopic restriction in form of constant charge density exists in the system. We developed and…
A general technique is outlined for investigating supersymmetry properties of a charged spin-$\half$ quantum particle in time-varying electromagnetic fields. The case of a time-varying uniform magnetic induction is examined and shown to…
We provide analysis of the convergence properties and applicability extensions of flat-histogram algorithms, with a particular focus on the Wang-Landau algorithms (exemplified by converging stochastic approximation Monte Carlo (SAMC)) and…
The fractionalization of microscopic degrees of freedom is a remarkable manifestation of strong interactions in quantum many-body systems. Analytical studies of this phenomenon are primarily based on two distinct frameworks: field theories…
The Massive Parallel Computation (MPC) model is a theoretical framework for popular parallel and distributed platforms such as MapReduce, Hadoop, or Spark. We consider the task of computing a large matching or small vertex cover in this…
In finite-size scaling analyses of Monte Carlo simulations of second-order phase transitions one often needs an extended temperature/energy range around the critical point. By combining the replica-exchange algorithm with cluster updates…
Hybrid parallelism techniques are essential for efficiently training large language models (LLMs). Nevertheless, current automatic parallel planning frameworks often overlook the simultaneous consideration of node heterogeneity and dynamic…
We explain the fundamental challenges of sampling from multimodal distributions, particularly for high-dimensional problems. We present the major types of MCMC algorithms that are designed for this purpose, including parallel tempering,…
The HP model of protein folding, where the chain exists in a free medium, is investigated using a parallel Monte Carlo scheme based upon Wang-Landau sampling. Expanding on the work of Wust and Landau by introducing a lesser known replica…
In quantum field theory, the splitting of the Hamiltonian into a strong and an electromagnetic part cannot be performed in a unique manner. We propose a convention for disentangling these two effects: one matches the parameters of two…
Quantum walks provide a natural framework to approach graph problems with quantum computers, exhibiting speedups over their classical counterparts for tasks such as the search for marked nodes or the prediction of missing links.…