Results 21 to 30 of about 3,741,395 (255)
Electronic Journal of Probability, 2023 36 pages, 9 ...
Defant, Colin, Li, Rupert
openaire +3 more sources
Parametric Markov Chains: PCTL Complexity and Fraction-free Gaussian Elimination [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 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
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023 In this paper, we introduce Max Markov Chain (MMC), a novel model for sequential data with sparse correlations among the state variables. It may also be viewed as a special class of approximate models for High-order Markov Chains (HMCs). MMC is desirable for domains where the sparse correlations are long-term and vary in their temporal stretches ...
Yu Zhang, Mitchell Bucklew
openaire +3 more sources
Information geometry of Markov Kernels: a survey
Frontiers in Physics, 2023 Information geometry and Markov chains are two powerful tools used in modern fields such as finance, physics, computer science, and epidemiology. In this survey, we explore their intersection, focusing on the theoretical framework.
Geoffrey Wolfer, Shun Watanabe
doaj +1 more source
Unpredictability in Markov chains [PDF]
Carpathian Journal of Mathematics, 2021 We have formalized realizations of Markov chains as conveniently constructed sequences, and explained, why the random dynamics admits the unpredictability, the concept introduced in our papers previously. The method of the domain structured dynamics (dynamics on labels) has been applied.
openaire +3 more sources
Correction : perfect simulation for a class of positive recurrent Markov chains [PDF]
, 2007 In [1] we introduced a class of positive recurrent Markov chains, named tame chains. A perfect simulation algorithm, based on the method of dominated CFTP, was then shown to exist in principle for such chains. The construction of a suitable dominating
Connor, Stephen B., Kendall, W. S.
core +1 more source
Approximate quantum Markov chains [PDF]
arXiv.org, 2018 In this chapter we discuss the concept of quantum Markov chains with a particular focus on the robustness of their properties. This results in a new class of states called approximate quantum Markov chains.
David Sutter
semanticscholar +1 more source
Optimal choice of word length when comparing two Markov sequences using a χ 2-statistic
BMC Genomics, 2017 Background Alignment-free sequence comparison using counts of word patterns (grams, k-tuples) has become an active research topic due to the large amount of sequence data from the new sequencing technologies.
Xin Bai +4 more
doaj +1 more source
MaMaDroid: Detecting Android Malware by Building Markov Chains of Behavioral Models [PDF]
Network and Distributed System Security Symposium, 2016 The rise in popularity of the Android platform has resulted in an explosion of malware threats targeting it. As both Android malware and the operating system itself constantly evolve, it is very challenging to design robust malware mitigation techniques ...
Enrico Mariconti +5 more
semanticscholar +1 more source
Theoretical Computer Science, 2011 The article introduces constraint Markov chains as a new tool for specification. They are a generalization of interval Markov chains. Interval Markov chains extend Markov chains by labeling transitions with intervals, implying that each transition probability needs to be within the according interval.
Caillaud, Benoit +5 more
openaire +5 more sources