Computational Discrete Time Markov Chain with Correlated Transition Probabilities
نویسندگان
چکیده
منابع مشابه
Markov chain small-world model with asymmetric transition probabilities
In this paper, a Markov chain small-world model of D.J. Higham is broadened by incorporating asymmetric transition probabilities. Asymptotic results regarding the transient behavior of the extended model, as measured by its maximum mean first passage time, are established under the assumption that the size of the Markov chain is large. These results are consistent with the outcomes as obtained ...
متن کاملEla Markov Chain Small-world Model with Asymmetric Transition Probabilities∗
In this paper, a Markov chain small-world model of D.J. Higham is broadened by incorporating asymmetric transition probabilities. Asymptotic results regarding the transient behavior of the extended model, as measured by its maximum mean first passage time, are established under the assumption that the size of the Markov chain is large. These results are consistent with the outcomes as obtained ...
متن کامل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...
متن کاملDiscrete Time Markov Chain (DTMC)
A. A stochastic process is a collection of random variables {X t , t ∈ T }. B. A sample path or realization of a stochastic process is the collection of values assumed by the random variables in one realization of the random process, e.g. C. The state space is the collection of all possible values the random variables can take on, i.e. it is the sample space of the random variables. For example...
متن کاملStabilization Analysis and Synthesis of Discrete-Time Descriptor Markov Jump Systems with Partially Unknown Transition Probabilities
A sufficient condition for the open loop system to be regular, causal and stochastically stable is proposed for a class of discrete-time descriptor Markov jump systems with partly unknown transition probabilities. The proposed criteria are in the form of a set of strict linear matrix inequalities and convenient for numerical realization. The presented condition used the information of unknown t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematics and Statistics
سال: 2006
ISSN: 1549-3644
DOI: 10.3844/jmssp.2006.457.459