相关论文: Quantification of coarse-graining error in Langevi…
The transient dynamics of quantum coherence of Gaussian states are investigated. The state is coupled to an external environment which can be described by a Fano-Anderson type Hamiltonian. Solving the quantum Langevin equation, we obtain…
The notion of mutual unbiasedness for coarse-grained measurements of quantum continuous variable systems is considered. It is shown that while the procedure of "standard" coarse graining breaks the mutual unbiasedness between conjugate…
We present a numerical method to produce stochastic dynamics according to the generalized Langevin equation with a non-stationary memory kernel. This type of dynamics occurs when a microscopic system with an explicitly time-dependent…
We discuss the design of an invariant measure-preserving transformed dynamics for the numerical treatment of Langevin dynamics based on rescaling of time, with the goal of sampling from an invariant measure. Given an appropriate monitor…
The automated construction of coarse-grained models represents a pivotal component in computer simulation of physical systems and is a key enabler in various analysis and design tasks related to uncertainty quantification. Pertinent methods…
Sampling equilibrium molecular configurations from the Boltzmann distribution is a longstanding challenge. Boltzmann Generators (BGs) address this by combining exact-likelihood generative models with importance sampling, but practical…
In recent years, simulation methods based on the scaling of atomic potential functions, such as quasi-coarse-grained dynamics and coarse-grained dynamics, have shown promising results for modeling crystalline systems at multiple scales.…
How can we learn the laws underlying the dynamics of stochastic systems when their trajectories are sampled sparsely in time? Existing methods either require temporally resolved high-frequency observations, or rely on geometric arguments…
Modeling a high-dimensional Hamiltonian system in reduced dimensions with respect to coarse-grained (CG) variables can greatly reduce computational cost and enable efficient bottom-up prediction of main features of the system for many…
This work is concerned with model reduction of stochastic differential equations and builds on the idea of replacing drift and noise coefficients of preselected relevant, e.g. slow variables by their conditional expectations. We extend…
We introduce an RG-inspired coarse-graining for extracting the collective features of data. The key to successful coarse-graining lies in finding appropriate pairs of data sets. We coarse-grain the two closest data in a regular real-space…
We introduce a parameter estimation method that utilizes microscopic data, specifically averages and correlations of selected microscopic observables, to determine the parameters of a stochastic differential equation governing…
The quantum-to-classical transition of a quantum state is a topic of great interest in fundamental and practical aspects. A coarse-graining in quantum measurement has recently been suggested as its possible account in addition to the usual…
Deep generative models have emerged as a powerful class of priors for signals in various inverse problems such as compressed sensing, phase retrieval and super-resolution. Here, we assume an unknown signal to lie in the range of some…
Coarse-graining (CG) accelerates molecular simulations of protein dynamics by simulating sets of atoms as singular beads. Backmapping is the opposite operation of bringing lost atomistic details back from the CG representation. While…
The first paper of this series [J. Chem. Phys. 158, 034103 (2023)] demonstrated that excess entropy scaling holds for both fine-grained and corresponding coarse-grained (CG) systems. Despite its universality, a more exact determination of…
We consider in this work the numerical computation of transport coefficients for Brownian dynamics. We investigate the discretization error arising when simulating the dynamics with the Smart MC algorithm (also known as Metropolis-adjusted…
Dynamics of non-Markovian systems is a classic problem yet it attracts an everlasting activity in physics and beyond. A powerful tool for modeling such setups is the Generalized Langevin Equation, however, its analysis typically poses a…
Graph coarsening is a technique for solving large-scale graph problems by working on a smaller version of the original graph, and possibly interpolating the results back to the original graph. It has a long history in scientific computing…
A new procedure for coarse-graining dynamical triangulations is presented. The procedure provides a meaning for the relevant value of observables when "probing at large scales", e.g. the average scalar curvature. The scheme may also be…