اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA Ruelle Operator for continuous time Markov Chains
190
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We consider a generalization of the Ruelle theorem for the case of continuous time problems. We present a result which we believe is important for future use in problems in Mathematical Physics related to $C^*$-Algebras We consider a finite state set $S$ and a stationary continuous time Markov Chain $X_t$, $tgeq 0$, taking values on S. We denote by $Omega$ the set of paths $w$ taking values on S (the elements $w$ are locally constant with left and right limits and are also right continuous on $t$). We consider an infinitesimal generator $L$ and a stationary vector $p_0$. We denote by $P$ the associated probability on ($Omega, {cal B}$). This is the a priori probability. All functions $f$ we consider bellow are in the set ${cal L}^infty (P)$. From the probability $P$ we define a Ruelle operator ${cal L}^t, tgeq 0$, acting on functions $f:Omega to mathbb{R}$ of ${cal L}^infty (P)$. Given $V:Omega to mathbb{R}$, such that is constant in sets of the form ${X_0=c}$, we define a modified Ruelle operator $tilde{{cal L}}_V^t, tgeq 0$. We are able to show the existence of an eigenfunction $u$ and an eigen-probability $ u_V$ on $Omega$ associated to $tilde{{cal L}}^t_V, tgeq 0$. We also show the following property for the probability $ u_V$: for any integrable $gin {cal L}^infty (P)$ and any real and positive $t$ $$ int e^{-int_0^t (V circ Theta_s)(.) ds} [ (tilde{{cal L}}^t_V (g)) circ theta_t ] d u_V = int g d u_V$$ This equation generalize, for the continuous time Markov Chain, a similar one for discrete time systems (and which is quite important for understanding the KMS states of certain $C^*$-algebras).
قيم البحث
اقرأ أيضاً
Continuous-time Markov chains are mathematical models that are used to describe the state-evolution of dynamical systems under stochastic uncertainty, and have found widespread applications in various fields. In order to make these models computation
ally tractable, they rely on a number of assumptions that may not be realistic for the domain of application; in particular, the ability to provide exact numerical parameter assessments, and the applicability of time-homogeneity and the eponymous Markov property. In this work, we extend these models to imprecise continuous-time Markov chains (ICTMCs), which are a robust generalisation that relaxes these assumptions while remaining computationally tractable. More technically, an ICTMC is a set of precise continuous-time finite-state stochastic processes, and rather than computing expected values of functions, we seek to compute lower expectations, which are tight lower bounds on the expectations that correspond to such a set of precise models. Note that, in contrast to e.g. Bayesian methods, all the elements of such a set are treated on equal grounds; we do not consider a distribution over this set. The first part of this paper develops a formalism for describing continuous-time finite-state stochastic processes that does not require the aforementioned simplifying assumptions. Next, this formalism is used to characterise ICTMCs and to investigate their properties. The concept of lower expectation is then given an alternative operator-theoretic characterisation, by means of a lower transition operator, and the properties of this operator are investigated as well. Finally, we use this lower transition operator to derive tractable algorithms (with polynomial runtime complexity w.r.t. the maximum numerical error) for computing the lower expectation of functions that depend on the state at any finite number of time points.
We are interested in the analysis of very large continuous-time Markov chains (CTMCs) with many distinct rates. Such models arise naturally in the context of reliability analysis, e.g., of computer network performability analysis, of power grids, of
computer virus vulnerability, and in the study of crowd dynamics. We use abstraction techniques together with novel algorithms for the computation of bounds on the expected final and accumulated rewards in continuous-time Markov decision processes (CTMDPs). These ingredients are combined in a partly symbolic and partly explicit (symblicit) analysis approach. In particular, we circumvent the use of multi-terminal decision diagrams, because the latter do not work well if facing a large number of different rates. We demonstrate the practical applicability and efficiency of the approach on two case studies.
We analyze some properties of maximizing stationary Markov probabilities on the Bernoulli space $[0,1]^mathbb{N}$, More precisely, we consider ergodic optimization for a continuous potential $A$, where $A: [0,1]^mathbb{N}to mathbb{R}$ which depends o
nly on the two first coordinates. We are interested in finding stationary Markov probabilities $mu_infty$ on $ [0,1]^mathbb{N}$ that maximize the value $ int A d mu,$ among all stationary Markov probabilities $mu$ on $[0,1]^mathbb{N}$. This problem correspond in Statistical Mechanics to the zero temperature case for the interaction described by the potential $A$. The main purpose of this paper is to show, under the hypothesis of uniqueness of the maximizing probability, a Large Deviation Principle for a family of absolutely continuous Markov probabilities $mu_beta$ which weakly converges to $mu_infty$. The probabilities $mu_beta$ are obtained via an information we get from a Perron operator and they satisfy a variational principle similar to the pressure. Under the hypothesis of $A$ being $C^2$ and the twist condition, that is, $frac{partial^2 A}{partial_x partial_y} (x,y) eq 0$, for all $(x,y) in [0,1]^2$, we show the graph property.
Verifying quantum systems has attracted a lot of interests in the last decades. In this paper, we initialised the model checking of quantum continuous-time Markov chain (QCTMC). As a real-time system, we specify the temporal properties on QCTMC by si
gnal temporal logic (STL). To effectively check the atomic propositions in STL, we develop a state-of-art real root isolation algorithm under Schanuels conjecture; further, we check the general STL formula by interval operations with a bottom-up fashion, whose query complexity turns out to be linear in the size of the input formula by calling the real root isolation algorithm. A running example of an open quantum walk is provided to demonstrate our method.
Let $Gamma$ be a co-compact Fuchsian group of isometries on the Poincare disk $DD$ and $Delta$ the corresponding hyperbolic Laplace operator. Any smooth eigenfunction $f$ of $Delta$, equivariant by $Gamma$ with real eigenvalue $lambda=-s(1-s)$, where
$s={1/2}+ it$, admits an integral representation by a distribution $dd_{f,s}$ (the Helgason distribution) which is equivariant by $Gamma$ and supported at infinity $partialDD=SS^1$. The geodesic flow on the compact surface $DD/Gamma$ is conjugate to a suspension over a natural extension of a piecewise analytic map $T:SS^1toSS^1$, the so-called Bowen-Series transformation. Let $ll_s$ be the complex Ruelle transfer operator associated to the jacobian $-sln |T|$. M. Pollicott showed that $dd_{f,s}$ is an eigenfunction of the dual operator $ll_s^*$ for the eigenvalue 1. Here we show the existence of a (nonzero) piecewise real analytic eigenfunction $psi_{f,s}$ of $ll_s$ for the eigenvalue 1, given by an integral formula [ psi_{f,s} (xi)=int frac{J(xi,eta)}{|xi-eta|^{2s}} dd_{f,s} (deta), ] oindent where $J(xi,eta)$ is a ${0,1}$-valued piecewise constant function whose definition depends upon the geometry of the Dirichlet fundamental domain representing the surface $DD/Gamma$.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
