On the reduction property of the number of H-equivalent tuples of states in a discrete Markov chain
From MaRDI portal
Publication:1744352
Recommendations
- On series of \(H\)-equivalent tuples in Markov chains
- Reduction techniques for discrete-time Markov chains on totally ordered state space using stochastic comparisons
- Reduction of Markov chains with two-time-scale state transitions
- On the distributions of the state sizes of discrete time homogeneous Markov systems
- The state reduction and related algorithms and their applications to the study of Markov chains, graph theory, and the optimal stopping problem
- On the Markov property of a finite hidden Markov chain
- On a counting variable in the theory of discrete-parameter Markov chains
Cites work
- scientific article; zbMATH DE number 5865333 (Why is no real title available?)
- scientific article; zbMATH DE number 1235881 (Why is no real title available?)
- Estimates of accuracy of the Poisson approximation for the distribution of number of runs of long string repetitions in a Markov chain
- Matchings up to permutations in sequences of independent trials
- Matchings up to the permutations which form a Latin rectangle
- On coincidences of tuples in a binary tree with random labels of vertices
- On multiple repetitions of long tuples in a Markov chain
- On repetitions of long tuples in a Markov chain
- On series of \(H\)-equivalent tuples in Markov chains
- On the probability of existence of substrings with the same structure in a random sequence
- Some monotonicity properties of Schur powers of matrices and related inequalities
- Structural equivalence of s-tuples in random discrete sequences
Cited in
(3)
This page was built for publication: On the reduction property of the number of \(H\)-equivalent tuples of states in a discrete Markov chain
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1744352)
