Results 1 to 10 of about 60,582 (310)
Qualitative reachability for open interval Markov chains [PDF]
PeerJ Computer Science, 2023 Interval Markov chains extend classical Markov chains with the possibility to describe transition probabilities using intervals, rather than exact values.
Jeremy Sproston
doaj +3 more sources
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 ...
Parosh Aziz Abdulla +2 more
doaj +5 more sources
Quantum speedup for nonreversible Markov chains [PDF]
Nature CommunicationsQuantum algorithms can potentially solve a handful of problems more efficiently than their classical counterparts. In that context, it has been discussed that Markov chains problems could be solved significantly faster using quantum computing.
Baptiste Claudon +2 more
doaj +2 more sources
Attainability for Markov and Semi-Markov Chains
MathematicsWhen studying Markov chain models and semi-Markov chain models, it is useful to know which state vectors n, where each component ni represents the number of entities in the state Si, can be maintained or attained.
Brecht Verbeken, Marie-Anne Guerry
doaj +3 more sources
Markov chains and applications
Selecciones Matemáticas, 2022 This work has three important purposes: first it is the study of Markov Chains, the second is to show that Markov chains have different applications and finally it is to model a process of this behaves. Throughout this work we will describe what a Markov
Mississippi Valenzuela
doaj +1 more source
Forum of Mathematics, Sigma, 2023 Let G be a finite group. Let $H, K$ be subgroups of G and $H \backslash G / K$ the double coset space. If Q is a probability on G which is constant on conjugacy classes ( $Q(s^{-1} t s) = Q(t)$ ), then the random walk driven by Q on G ...
Persi Diaconis +2 more
doaj +1 more source
Decomposition of Finitely Additive Markov Chains in Discrete Space
Mathematics, 2022 In this study, we consider general Markov chains (MC) defined by a transition probability (kernel) that is finitely additive. These Markov chains were constructed by S. Ramakrishnan within the concepts and symbolism of game theory.
Alexander Zhdanok, Anna Khuruma
doaj +1 more source
Plithogenic and Neutrosophic Markov Chains: Modeling Uncertainty and Ambiguity in Stochastic Processes [PDF]
Neutrosophic Sets and Systems, 2023 In this work we present for the first time the concept of literal neutrosophic markov chains and literal plithogenic markov chains. Also, we presented many theorems related to the properties of transition matrix.
Suhar Massassati +2 more
doaj
On Optimal Identification of Distribution for Two Independent Markov Chains to the Subject Reliability Criterian [PDF]
Control and Optimization in Applied Mathematics, 2021 In this paper, the problem of identification of distributions for two independent objects via simple homogeneous stationary Markov chains with a finite number of states is studied.
Leader Navaei, Reza Akbari
doaj +1 more source
Journal of Applied Mathematics, 2020 This paper deals with the computation of invariant measures and stationary expectations for discrete-time Markov chains governed by a block-structured one-step transition probability matrix.
Hendrik Baumann, Thomas Hanschke
doaj +1 more source