Searcharxiv⌕ Search

arXiv subjects

Jianpeng Ma

Publications and source records attributed to Jianpeng Ma.

21 records · Page 2Linked to original sources

Enhanced sampling in generalized ensemble with large gap of sampling parameter: case study in temperature space random walk

We present an efficient sampling method for computing a partition function and accelerating configuration sampling. The method performs a random walk in the $λ$ space, with $λ$ being any thermodynamic variable that characterizes a canonical ensemble such as the reciprocal temperature $β$ or any variable that the Hamiltonian explicitly depends on. The partition function is determined by minimizing the difference of the thermal conjugates of $λ$ (the energy in the case of $λ=β$), defined as the difference between the value from the dynamically updated derivatives of the partition function and the value directly measured from simulation. Higher-order derivatives of the partition function are included to enhance the Brownian motion in the $λ$ space. The method is much less sensitive to the system size, and the size of $λ$ window than other methods. On the two dimensional Ising model, it is shown that the method asymptotically converges the partition function, and the error of the logarithm of the partition function is much smaller than the algorithm using the Wang-Landau recursive scheme. The method is also applied to off-lattice model proteins, the $AB$ models, in which cases many low energy states are found in different models.

physics.comp-ph↗

Counting Solutions for the N-queens and Latin Square Problems by Efficient Monte Carlo Simulations

We apply Monte Carlo simulations to count the numbers of solutions of two well-known combinatorial problems: the N-queens problem and Latin square problem. The original system is first converted to a general thermodynamic system, from which the number of solutions of the original system is obtained by using the method of computing the partition function. Collective moves are used to further accelerate sampling: swap moves are used in the N-queens problem and a cluster algorithm is developed for the Latin squares. The method can handle systems of $10^4$ degrees of freedom with more than $10^10000$ solutions. We also observe a distinct finite size effect of the Latin square system: its heat capacity gradually develops a second maximum as the size increases.

cond-mat.stat-mech↗

Simulation via Direct Computation of Partition Functions

In this paper, we demonstrate the efficiency of simulations via direct computation of the partition function under various macroscopic conditions, such as different temperatures or volumes. The method can compute partition functions by flattening histograms, through the Wang-Landau recursive scheme, outside the energy space. This method offers a more general and flexible framework for handling various types of ensembles, especially the ones in which computation of the density of states is not convenient. It can be easily scaled to large systems, and it is flexible in incorporating Monte Carlo cluster algorithms or molecular dynamics. High efficiency is shown in simulating large Ising models, in finding ground states of simple protein models, and in studying the liquid-vapor phase transition of a simple fluid. The method is very simple to implement and we expect it to be efficient in studying complex systems with rugged energy landscapes, e.g., biological macromolecules.

cond-mat.stat-mech↗