ﻻ يوجد ملخص باللغة العربية
In light of the recently developed complete GJ set of single random variable stochastic, discrete-time St{o}rmer-Verlet algorithms for statistically accurate simulations of Langevin equations, we investigate two outstanding questions: 1) Are there any algorithmic or statistical benefits from including multiple random variables per time-step, and 2) are there objective reasons for using one or more methods from the available set of statistically correct algorithms? To address the first question, we assume a general form for the discrete-time equations with two random variables and then follow the systematic, brute-force GJ methodology by enforcing correct thermodynamics in linear systems. It is concluded that correct configurational Boltzmann sampling of a particle in a harmonic potential implies correct configurational free-particle diffusion, and that these requirements only can be accomplished if the two random variables per time step are identical. We consequently submit that the GJ set represents all possible stochastic St{o}rmer-Verlet methods that can reproduce time-step-independent statistics of linear systems. The second question is thus addressed within the GJ set. Based in part on numerical simulations of complex molecular systems, and in part on analytic scaling of time, we analyze the apparent difference in stability between different methods. We attribute this difference to the inherent time scaling in each method, and suggest that this scaling may lead to inconsistencies in the interpretation of dynamical and statistical simulation results. We therefore suggest that the method with the least inherent time-scaling, the GJ-I/GJF-2GJ method, be preferred for statistical applications where spurious rescaling of time is undesirable.
We present the complete set of stochastic Verlet-type algorithms that can provide correct statistical measures for both configurational and kinetic sampling in discrete-time Langevin systems. The approach is a brute-force general representation of th
We investigate the ergodicity and hot solvent/cold solute problems in molecular dynamics simulations. While the kinetic moments and the stimulated Nose--Hoover methods improve the ergodicity of a harmonic-oscillator system, both methods exhibit the h
We expand on two previous developments in the modeling of discrete-time Langevin systems. One is the well-documented Gr{o}nbech-Jensen Farago (GJF) thermostat, which has been demonstrated to give robust and accurate configurational sampling of the ph
We present efficient algorithms to generate a bit string in which each bit is set with arbitrary probability. By adopting a hybrid algorithm, i.e., a finite-bit density approximation with correction techniques, we achieve 3.8 times faster random bit
Multivariate fluctuation relations are established in three stochastic models of transistors, which are electronic devices with three ports and thus two coupled currents. In the first model, the transistor has no internal state variable and particle