Results 1 to 10 of about 192,524 (234)
Logical Methods in Computer Science, 2007 We consider qualitative and quantitative verification problems for infinite-state Markov chains. We call a Markov chain decisive w.r.t. a given set of target states F if it almost certainly eventually reaches either F or a state from which F can no ...
Abdulla, Parosh Aziz +2 more
core +6 more sources
A Definition Scheme for Quantitative Bisimulation [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 FuTS, state-to-function transition systems are generalizations of labeled transition systems and of familiar notions of quantitative semantical models as continuous-time Markov chains, interactive Markov chains, and Markov automata.
de Vink, Erik +2 more
core +3 more sources
, 1999 We study irreducible time-homogenous Markov chains with finite state space in discrete time. We obtain results on the sensitivity of the stationary distribution and other statistical quantities with respect to perturbations of the transition matrix.
Barlow +10 more
core +12 more sources
Isotropy Properties of the Multi-Step Markov Symbolic Sequences [PDF]
, 2006 A new object of the probability theory, the two-sided chain of symbols (introduced in Ref. arXiv:physics/0306170) is used to study isotropy properties of binary multi-step Markov chains with the long-range correlations.
Balucani +24 more
core +2 more sources
Quantum Markov fields on graphs [PDF]
, 2010 We introduce generalized quantum Markov states and generalized d-Markov chains which extend the notion quantum Markov chains on spin systems to that on $C^*$-algebras defined by general graphs. As examples of generalized d-Markov chains, we construct the
Accardi L. +4 more
core +3 more sources
Qualitative Reachability for Open Interval Markov Chains [PDF]
, 2018 Interval Markov chains extend classical Markov chains with the possibility to describe transition probabilities using intervals, rather than exact values.
Sproston, Jeremy
core +2 more sources
Hitting Times and Probabilities for Imprecise Markov Chains [PDF]
, 2019 We consider the problem of characterising expected hitting times and hitting probabilities for imprecise Markov chains. To this end, we consider three distinct ways in which imprecise Markov chains have been defined in the literature: as sets of ...
De Bock, Jasper +2 more
core +2 more sources
Derivatives of Entropy Rate in Special Families of Hidden Markov Chains [PDF]
, 2006 Consider a hidden Markov chain obtained as the observation process of an ordinary Markov chain corrupted by noise. Zuk, et. al. [13], [14] showed how, in principle, one can explicitly compute the derivatives of the entropy rate of at extreme values of ...
Author(s Han +3 more
core +2 more sources
Self-similar scaling limits of Markov chains on the positive integers [PDF]
, 2015 We are interested in the asymptotic behavior of Markov chains on the set of positive integers for which, loosely speaking, large jumps are rare and occur at a rate that behaves like a negative power of the current state, and such that small positive and ...
Bertoin, Jean, Kortchemski, Igor
core +1 more source
Parallelization of Markov chain generation and its application to the multicanonical method
, 2009 We develop a simple algorithm to parallelize generation processes of Markov chains. In this algorithm, multiple Markov chains are generated in parallel and jointed together to make a longer Markov chain.
Berg B. A. +13 more
core +1 more source