Monte Carlo sampling in diffusive dynamical systems
arXiv:1804.06698 · doi:10.1063/1.5025627
Abstract
We introduce a Monte Carlo algorithm to efficiently compute transport properties of chaotic dynamical systems. Our method exploits the importance sampling technique that favors trajectories in the tail of the distribution of displacements, where deviations from a diffusive process are most prominent. We search for initial conditions using a proposal that correlates states in the Markov chain constructed via a Metropolis-Hastings algorithm. We show that our method outperforms the direct sampling method and also Metropolis-Hastings methods with alternative proposals. We test our general method through numerical simulations in 1D (box-map) and 2D (Lorentz gas) systems.
arXiv comment11 pages, 5 figures. Codes available at: https://github.com/dapias/MCMC-DIFFUSION
References in corpus (14)
- Probing rare physical trajectories with Lyapunov weighted dynamics
- Simple Maps with Fractal Diffusion Coefficients
- Occurrence of normal and anomalous diffusion in polygonal billiard channels
- A Comparison of Methods for Computing Autocorrelation Time
- Rare event computation in deterministic chaotic systems using genealogical particle analysis
- Fractal Properties of Anomalous Diffusion in Intermittent Maps
- Multicanonical MCMC for Sampling Rare Events
- Measuring logarithmic corrections to normal diffusion in infinite-horizon billiards
- Identifying rare chaotic and regular trajectories in dynamical systems with Lyapunov weighted path sampling
- Monte Carlo Sampling in Fractal Landscapes
- Fine structure of distributions and central limit theorem in diffusive billiards
- Efficiency of Monte Carlo Sampling in Chaotic Systems
- Importance Sampling of Rare Events in Chaotic Systems
- Deterministic Diffusion in Periodic Billiard Models