Computing the minimal rebinding effect for non-reversible processes

07/16/2020
by   Susanne Röhl, et al.
0

The aim of this paper is to investigate the rebinding effect, a phenomenon describing a "short-time memory" which can occur when projecting a Markov process onto a smaller state space. For guaranteeing a correct mapping by the Markov State Model, we assume a fuzzy clustering in terms of membership functions, assigning degrees of membership to each state. The macro states are represented by the membership functions and may be overlapping. The magnitude of this overlap is a measure for the strength of the rebinding effect, caused by the projection and stabilizing the system. A minimal bound for the rebinding effect included in a given system is computed as the solution of an optimization problem. Based on membership functions chosen as a linear combination of Schur vectors, this generalized approach includes reversible as well as non-reversible processes.

READ FULL TEXT
research
10/30/2021

Non-reversible processes: GENERIC, Hypocoercivity and fluctuations

We consider two approaches to study non-reversible Markov processes, nam...
research
05/12/2020

Non-reversible guided Metropolis-Hastings kernel

We construct a non-reversible Metropolis-Hastings kernel as a multivaria...
research
04/12/2018

A fuzzy process of individuation

It is shown that an aspect of the process of individuation may be though...
research
03/15/2023

Estimating Parameters of Large CTMP from Single Trajectory with Application to Stochastic Network Epidemics Models

Graph dynamical systems (GDS) model dynamic processes on a (static) grap...
research
12/24/2022

An optimized fuzzy logic model for proactive maintenance

Fuzzy logic has been proposed in previous studies for machine diagnosis,...
research
07/24/2019

Universality of the Langevin diffusion as scaling limit of a family of Metropolis-Hastings processes I: fixed dimension

Given a target distribution μ on a general state space X and a proposal ...
research
04/07/2022

Strong Admissibility, a Tractable Algorithmic Approach (proofs)

Much like admissibility is the key concept underlying preferred semantic...

Please sign up or login with your details

Forgot password? Click here to reset