Related papers: Rejection-free cluster Wang-Landau algorithm for h…
We give the first $2$-approximation algorithm for the cluster vertex deletion problem. This is tight, since approximating the problem within any constant factor smaller than $2$ is UGC-hard. Our algorithm combines the previous approaches,…
Wang-Landau sampling has been applied to investigate the thermodynamics and structural properties of a lattice hydrophobic-polar heteropolymer (the HP protein model) interacting with an attractive substrate. For simplicity, we consider a…
The simulation of strongly correlated electron systems remains a formidable challenge. Certain experimentally relevant dynamical response functions are especially difficult to calculate, due to issues of finite-size effects and the ill…
A new method that accurately describes strongly correlated states and captures dynamical correlation is presented. It is derived as a modification of coupled-cluster theory with single and double excitations (CCSD) through consideration of…
We discuss the hard-hexagon and hard-square problems, as well as the corresponding problem on the honeycomb lattice. The case when the activity is unity is of interest to combinatorialists, being the problem of counting binary matrices with…
We study the entanglement properties of a quantum lattice-gas model for which we can find the exact ground state (of the Rokhsar-Kivelson type). The ground state can be expressed as a superposition of states, each of which is characterized…
We develop an approach to apply Wang-Landau algorithm to multicomponent alloys in semi-grand-canonical ensemble. Although the Wang-Landau algorithm has great advantages over conventional sampling methods, there are few applications to…
In [7], a cluster expansion method has been developed to study the fluctuations of the hard sphere dynamics around the Boltzmann equation. This method provides a precise control on the exponential moments of the empirical measure, from…
We present a new Monte Carlo algorithm that produces results of high accuracy with reduced simulational effort. Independent random walks are performed (concurrently or serially) in different, restricted ranges of energy, and the resultant…
We discuss a new class of driven lattice gas obtained by coupling the one-dimensional totally asymmetric simple exclusion process to Langmuir kinetics. In the limit where these dynamics are competing, the resulting non-conserved flow of…
This paper considers a canonical clustering problem where one receives unlabeled samples drawn from a balanced mixture of two elliptical distributions and aims for a classifier to estimate the labels. Many popular methods including PCA and…
We discuss a new Monte Carlo algorithm for the simulation of complex fluids. This algorithm employs geometric operations to identify clusters of particles that can be moved in a rejection-free way. It is demonstrated that this geometric…
A discrete-time totally asymmetric simple exclusion process on a lattice with open boundaries is considered. There are particles of different types. The type of a particle is characterized by the probability that a particle moves to a…
Model-based clustering of moderate or large dimensional data is notoriously difficult. We propose a model for simultaneous dimensionality reduction and clustering by assuming a mixture model for a set of latent scores, which are then linked…
We applied cluster density matrix embedding theory, with some modifications, to a spin lattice system. The reduced density matrix of the impurity cluster is embedded in the bath states, which are a set of block-product states. The ground…
We present an efficient Monte Carlo algorithm for determining the density of states which is based on the statistics of transition probabilities between states. By measuring the infinite temperature transition probabilities--that is, the…
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…
When simulating a lattice system near its critical temperature, local algorithms for modeling the system's evolution can introduce very large autocorrelation times into sampled data. This critical slowing down places restrictions on the…
We derive a formula that expresses the density of states of a system with continuous degrees of freedom as a function of microcanonical averages of squared gradient and Laplacian of the Hamiltonian. This result is then used to propose a…
This paper presents new low-complexity lattice-decoding algorithms for noncoherent block detection of QAM and PAM signals over complex-valued fading channels. The algorithms are optimal in terms of the generalized likelihood ratio test…