Results 11 to 20 of about 192,524 (234)
Qualitative reachability for open interval Markov chains. [PDF]
Interval Markov chains extend classical Markov chains with the possibility to describe transition probabilities using intervals, rather than exact values.
Sproston J.
europepmc +3 more sources
Quantum speedup for nonreversible Markov chains. [PDF]
Quantum 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.
Claudon B, Piquemal JP, Monmarché P.
europepmc +2 more sources
Markov chains and applications
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
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
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]
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
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
In this paper we consider the research and development of classifiers that are trained to predict the task solved by source code. Possible applications of such task detection algorithms include method name prediction, hardware–software partitioning ...
Artyom V. Gorchakov +2 more
doaj +1 more source
Parametric Markov Chains: PCTL Complexity and Fraction-free Gaussian Elimination [PDF]
Parametric Markov chains have been introduced as a model for families of stochastic systems that rely on the same graph structure, but differ in the concrete transition probabilities. The latter are specified by polynomial constraints for the parameters.
Lisa Hutschenreiter +2 more
doaj +1 more source
Optimal control of multiple Markov-switching stochastic systems with numerical applications
In this article the authors set up an optimal control framework for a hybrid stochastic system with dual or multiple Markov switching diffusion processes, while Markov chains governing these switching diffusions are not identical as assumed in the ...
Jianmin Shi
doaj +1 more source

