Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userSimulating sticky particles: A Monte Carlo method to sample a stratification
68
0
0.0
(
0
)
Added by
Miranda Holmes-Cerfon
Publication date
2019
fields
Physics
and research's language is
English
Authors
Miranda Holmes-Cerfon
Ask ChatGPT about the research
No Arabic abstract
Many problems in materials science and biology involve particles interacting with strong, short-ranged bonds, that can break and form on experimental timescales. Treating such bonds as constraints can significantly speed up sampling their equilibrium distribution, and there are several methods to sample probability distributions subject to fixed constraints. We introduce a Monte Carlo method to handle the case when constraints can break and form. More generally, the method samples a probability distribution on a stratification: a collection of manifolds of different dimensions, where the lower-dimensional manifolds lie on the boundaries of the higher-dimensional manifolds. We show several applications of the method in polymer physics, self-assembly of colloids, and volume calculation in high dimensions.
rate research
Read More
We study some aspects of a Monte Carlo method invented by Maggs and Rossetto for simulating systems of charged particles. It has the feature that the discretized electric field is updated locally when charges move. Results of simulations of the two dimensional one-component plasma are presented. Highly accurate results can be obtained very efficiently using this lattice method over a large temperature range. The method differs from global methods in having additional degrees of freedom which leads to the question of how a faster method can result. We argue that efficient sampling depends on charge mobility and find that the mobility is close to maximum for a low rate of independent plaquette updates for intermediate temperatures. We present a simple model to account for this behavior. We also report on the role of uniform electric field sampling using this method.
Anomalous short- and long-time self-diffusion of non-overlapping fractal particles on a percolation cluster with spreading dimension $1.67(2)$ is studied by dynamic Monte Carlo simulations. As reported in Phys. Rev. Lett. 115, 097801 (2015), the disordered phase formed by these particles is that of an unconfined, homogeneous and monodisperse fluid in fractal space. During particle diffusion in thermodynamic equilibrium, the mean squared chemical displacement increases as a nonlinear power of time, with an exponent of $0.96(1)$ at short times and $0.63(1)$ at long times. At finite packing fractions the steric hindrance among nearest neighbor particles leads to a sub-diffusive regime that separates short-time anomalous diffusion from long-time anomalous diffusion. Particle localization is observed over eight decades in time for packing fractions of $sim 60%$ and higher.
Distances to high mass star forming regions (HMSFRs) in the Milky Way are a crucial constraint on the structure of the Galaxy. Only kinematic distances are available for a majority of the HMSFRs in the Milky Way. Here we compare the kinematic and parallax distances of 75 Galactic HMSFRs to assess the accuracy of kinematic distances. We derive the kinematic distances using three different methods: the traditional method using the Brand & Blitz (1993) rotation curve (Method A), the traditional method using the Reid et al. (2014) rotation curve and updated Solar motion parameters (Method B), and a Monte Carlo technique (Method C). Methods B and C produce kinematic distances closest to the parallax distances, with median differences of 13% (0.43 kpc) and 17% (0.42 kpc), respectively. Except in the vicinity of the tangent point, the kinematic distance uncertainties derived by Method C are smaller than those of Methods A and B. In a large region of the Galaxy, the Method C kinematic distances constrain both the distances and the Galactocentric positions of HMSFRs more accurately than parallax distances. Beyond the tangent point along longitude=30 degrees, for example, the Method C kinematic distance uncertainties reach a minimum of 10% of the parallax distance uncertainty at a distance of 14 kpc. We develop a prescription for deriving and applying the Method C kinematic distances and distance uncertainties. The code to generate the Method C kinematic distances is publicly available and may be utilized through an on-line tool.
We propose a minimal generalization of the celebrated Markov-Chain Monte Carlo algorithm which allows for an arbitrary number of configurations to be visited at every Monte Carlo step. This is advantageous when a parallel computing machine is available, or when many biased configurations can be evaluated at little additional computational cost. As an example of the former case, we report a significant reduction of the thermalization time for the paradigmatic Sherrington-Kirkpatrick spin-glass model. For the latter case, we show that, by leveraging on the exponential number of biased configurations automatically computed by Diagrammatic Monte Carlo, we can speed up computations in the Fermi-Hubbard model by two orders of magnitude.
Differentiable programming has emerged as a key programming paradigm empowering rapid developments of deep learning while its applications to important computational methods such as Monte Carlo remain largely unexplored. Here we present the general theory enabling infinite-order automatic differentiation on expectations computed by Monte Carlo with unnormalized probability distributions, which we call automatic differentiable Monte Carlo (ADMC). By implementing ADMC algorithms on computational graphs, one can also leverage state-of-the-art machine learning frameworks and techniques to traditional Monte Carlo applications in statistics and physics. We illustrate the versatility of ADMC by showing some applications: fast search of phase transitions and accurately finding ground states of interacting many-body models in two dimensions. ADMC paves a promising way to innovate Monte Carlo in various aspects to achieve higher accuracy and efficiency, e.g. easing or solving the sign problem of quantum many-body models through ADMC.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
