A Universal Dilation of Discrete Markov Evolutions
نویسنده
چکیده
Given a finite state space E, we build a universal dilation for all possible discrete time Markov chains on E, homogeneous or not: we introduce a second system (an “environment”) and a deterministic invertible time-homogeneous global evolution of the system E with this environment such that any Markov evolution of E can be realized by a proper choice of the initial (random) state of the environment, which therefore determines the transition probabilities of the system. We also compare this dilation with the quantum dilations of a Quantum Dynamical Semigroup: given a Classical Markov Semigroup, we show that it can be extended to a Quantum Dynamical Semigroup for which we can find a quantum dilation to a group of ∗-automorphisms admitting an invariant abelian subalgebra where this quantum dilation gives just our classical dilation.
منابع مشابه
Classical dilations à la Quantum Probability of Markov evolutions in discrete time
We study the Classical Probability analogue of the dilations of a quantum dynamical semigroup in Quantum Probability. Given a (not necessarily homogeneous) Markov chain in discrete time in a finite state space E, we introduce a second system, an environment, and a deterministic invertible time-homogeneous global evolution of the system E with this environment such that the original Markov evolu...
متن کاملDilations, models, scattering and spectral problems of 1D discrete Hamiltonian systems
In this paper, the maximal dissipative extensions of a symmetric singular 1D discrete Hamiltonian operator with maximal deficiency indices (2,2) (in limit-circle cases at ±∞) and acting in the Hilbert space ℓ_{Ω}²(Z;C²) (Z:={0,±1,±2,...}) are considered. We consider two classes dissipative operators with separated boundary conditions both at -∞ and ∞. For each of these cases we establish a self...
متن کاملArrival probability in the stochastic networks with an established discrete time Markov chain
The probable lack of some arcs and nodes in the stochastic networks is considered in this paper, and its effect is shown as the arrival probability from a given source node to a given sink node. A discrete time Markov chain with an absorbing state is established in a directed acyclic network. Then, the probability of transition from the initial state to the absorbing state is computed. It is as...
متن کاملMarkov Chain Anticipation for the Online Traveling Salesman Problem by Simulated Annealing Algorithm
The arc costs are assumed to be online parameters of the network and decisions should be made while the costs of arcs are not known. The policies determine the permitted nodes and arcs to traverse and they are generally defined according to the departure nodes of the current policy nodes. In on-line created tours arc costs are not available for decision makers. The on-line traversed nodes are f...
متن کاملRelative Entropy Rate between a Markov Chain and Its Corresponding Hidden Markov Chain
In this paper we study the relative entropy rate between a homogeneous Markov chain and a hidden Markov chain defined by observing the output of a discrete stochastic channel whose input is the finite state space homogeneous stationary Markov chain. For this purpose, we obtain the relative entropy between two finite subsequences of above mentioned chains with the help of the definition of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005