Related papers: Coarse-graining and reconstruction for Markov matr…
Due to the wide range of timescales that are present in macromolecular systems, hierarchical multiscale strategies are necessary for their computational study. Coarse-graining (CG) allows to establish a link between different system…
To investigate the impact of non-linear interactions on dynamic coarse graining, we study a simplified model system, featuring a tracer particle in a complex environment. Using a projection operator formalism and computer simulations, we…
We propose an efficient Markov Chain Monte Carlo method for sampling equilibrium distributions for stochastic lattice models, capable of handling correctly long and short-range particle interactions. The proposed method is a Metropolis-type…
We study coarse-graining methods for stochastic differential equations. In particular we consider averaging and a type of projection operator method, sometimes referred to as effective dynamic via conditional expectations. The projection…
Multiscale molecular modeling is widely applied in scientific research of molecular properties over large time and length scales. Two specific challenges are commonly present in multiscale modeling, provided that information between the…
We present a real-space formulation for coarse-graining Kohn-Sham Density Functional Theory that significantly speeds up the analysis of material defects without appreciable loss of accuracy. The approximation scheme consists of two steps.…
We present a dynamic coarse-graining technique that allows to simulate the mechanical unfolding of biomolecules or molecular complexes on experimentally relevant time scales. It is based on Markov state models (MSM), which we construct from…
This paper considers the reduction of the Langevin equation arising from bio-molecular models. To facilitate the construction and implementation of the reduced models, the problem is formulated as a reduced-order modeling problem. The…
Big data often has emergent structure that exists at multiple levels of abstraction, which are useful for characterizing complex interactions and dynamics of the observations. Here, we consider multiple levels of abstraction via a…
Functional inequalities such as the Poincar\'e and log-Sobolev inequalities quantify convergence to equilibrium in continuous-time Markov chains by linking generator properties to variance and entropy decay. However, many applications,…
A coarse grid correction (CGC) approach is proposed to enhance the efficiency of the matrix exponential and $\varphi$ matrix function evaluations. The approach is intended for iterative methods computing the matrix-vector products with…
Dynamical systems with large state-spaces are often expensive to thoroughly explore experimentally. Coarse-graining methods aim to define simpler systems which are more amenable to analysis and exploration; most current methods, however,…
We propose a novel coarse graining tensor renormalization group method based on the higher-order singular value decomposition. This method provides an accurate but low computational cost technique for studying both classical and quantum…
We explain a method, inspired by control theory model reduction and interpolation theory, that rigorously establishes the types of coarse graining that are appropriate for systems with quadratic, generalized Hamiltonians. For such systems,…
We propose a systematic coarse-grained representation of block copolymers, whereby each block is reduced to a single ``soft blob'' and effective intra- as well as intermolecular interactions act between centres of mass of the blocks. The…
We present a new approach to coarse-graining of variables describing dust flow in GR. It is based on assigning quasi-local shear, twist and expansion to 2-dimensional surfaces with the help of isometric embeddings into the 3-dimensional…
We propose that Kreimer's method of Feynman diagram renormalization via a Hopf algebra of rooted trees can be fruitfully employed in the analysis of block spin renormalization or coarse graining of inhomogeneous statistical systems.…
In recent years, it has become increasingly popular to construct coarse-grained models with non-Markovian dynamics to account for an incomplete separation of time scales. One challenge of a systematic coarse-graining procedure is the…
Difficult, in particular NP-complete, optimization problems are traditionally solved approximately using search heuristics. These are usually slowed down by the rugged landscapes encountered, because local minima arrest the search process.…
Hybrid multiscale modelling has emerged as a useful framework for modelling complex biological phenomena. However, when accounting for stochasticity in the internal dynamics of agents, these models frequently become computationally…