Metabasins or a State Space Aggregation for Finite Markov Chains with exponentially small Transition Probabilities

نویسندگان

  • Andrea Winkler
  • Martin Stein
  • Gerold Alsmeyer
  • Matthias Löwe
چکیده

The present work is devoted to a phenomenon known from physics and chemistry that is hitherto studied only by means of computer simulations and neither there nor in mathematics rigorously defined: the notion of metabasins. Metabasins are a partition of the state space of certain physical systems according to specific aggregation rules along a given finite simulation path. The main challenge of this thesis lies in the construction and analysis of a path-independent approach providing certain metabasin-intrinsic properties (see Properties 1–5 in the Introduction). These are for instance the occurrence of specific sojourn times, the absence of multiple forward-backward jumps, the independence of entrance and exit state, or the similarity of energy barriers between different basins. The study of this problem is done within the framework of ergodic, reversible finite Markov chains with exponentially small transition probabilities depending on some energy function. In the first part of this thesis, a definition of metabasins is developed, which relies on the well established theory of metastability and complies with Properties 1–5. These metabasins basically emerge as valleys and unions of valleys of the energy landscape. Unlike similar works on this topic, valleys of completely different order are considered. Having introduced and analyzed those valleys and the notion of stability which is immanent to them in detail, the requested properties are derived. For this purpose, the process behavior on single valleys and the transitions between them are entirely specified. More specifically, typical trajectories on single valleys are determined, the average sojourn times are identified to depend on the depth of the valley in an exponential manner, and a certain aggregated process is defined that detects only the current valley and neglects the specific state therein. For this process, an asymptotic (semi-)Markov property is proved and its transition probabilities are determined. Using these probabilities, multiple forward-backward jumps are shown to be quite unlikely if and only if the energy barriers are approximately of the same height. The second part of this work is addressed to the goodness of the aggregation and studies the accordance with the path-dependent definition as well as the impact of the aggregation on the mixing-, cover-, and hitting times. The probability of accordance of both definitions is described by means of certain parameters measuring the degree of disorder in the system. For highly disordered systems arises a high probability of accordance. Furthermore, it is proved that the impact of the …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Markov Chains with Exponentially Small Transition Probabilities: First Exit Problem from a General Domain

We consider general ergodic aperiodic Markov chains with nite state space whose transition probabilities between pairs of diierent communicating states are exponentially small in a large parameter. We extend previous results by Freidlin and Wentzell (FW]) on the rst exit problem from a general domain Q. In the present paper we analyze the case of reversible Markov chains. The general case will ...

متن کامل

Markov chains and mixing times

For our purposes, a Markov chain is a (finite or countable) collection of states S and transition probabilities pij, where i, j ∈ S. We write P = [pij] for the matrix of transition probabilities. Elements of S can be interpreted as various possible states of whatever system we are interested in studying, and pij represents the probability that the system is in state j at time n+ 1, if it is sta...

متن کامل

Diffusion Approximation for Bayesian Markov Chains

Given a Markov chain with uncertain transition probabilities modelled in a Bayesian way, we investigate a technique for analytically approximating the mean transition frequency counts over a finite horizon. Conventional techniques for addressing this problem either require the enumeration of a set of generalized process "hyperstates" whose cardinality grows exponentially with the terminal horiz...

متن کامل

Reliability Assessment of Power Generation Systems in Presence of Wind Farms Using Fuzzy Logic Method

A wind farm is a collection of wind turbines built in an area to provide electricity. Wind power is a renewable energy resource and an alternative to non-renewable fossil fuels. In this paper impact of wind farms in power system reliability is investigate and a new procedure for reliability assessment of wind farms in HL1 level is proposed. In proposed procedure, application of Fuzzy – Markov f...

متن کامل

Limiting Distributions in Markov Chains

One of the principal questions involving Markov chains is what are the long-time (asymptotic) properties of the chain? Before we can formulate the question precisely, we need to introduce some ideas. Suppose we have a Markov chain {Xn}n∈N on a finite or countable state space S with transition probabilities Pi,j = P (Xn+1 = j | Xn = i), i, j ∈ S. We let N denote the number of elements in S (note...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013