Sur deux problèmes de M. Kolmogoroff concernant les chaînes dénombrables
From MaRDI portal
Publication:5771934
Cited in
(18)- A graph counterexample to Davies' conjecture
- On the rate of convergence for infinite server Erlang-Sevastyanov's problem
- The visits to zero of a random walk driven by an irrational rotation
- Limit theorems for additive functionals of a Markov chain
- Regeneration for chains with infinite memory
- Contributions to the Theory of Markov Chains. II
- An Arcsine Law for Markov Chains
- The Boyer-Moore-Horspool heuristic with Markovian input
- Occupation Times for Markov and Semi-Markov Chains
- scientific article; zbMATH DE number 3563984 (Why is no real title available?)
- A renewal approach to Markovian \(U\)-statistics
- LOCAL LIMIT THEOREMS FOR PARTIAL SUMS OF STATIONARY SEQUENCES GENERATED BY GIBBS–MARKOV MAPS
- Some Contributions to the Theory of Denumerable Markov Chains
- On the central limit theorem for the sum of a random number of independent random variables
- Limit theorems for recurrent semi-Markov processes and Markov renewal processes
- Ergodicity of regime-switching functional diffusions with infinite delay and application to a numerical algorithm for stochastic optimization
- A multiple time renewal equation for neural assemblies with elapsed time model
- Some examples and results in the theory of mixing and random-sum central limit theorems
This page was built for publication: Sur deux problèmes de M. Kolmogoroff concernant les chaînes dénombrables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5771934)