On completeness of random transition counts for Markov chains. II

  1. Agnieszka Palma

Abstract

It is shown that the random transition count is complete for Markov chains with a fixed length and a fixed initial state, for some subsets of the set of all transition probabilities. The main idea is to apply graph theory to prove completeness in a more general case than in Palma.

 

Download article

This article

Probability and Mathematical Statistics

32, z. 2, 2012

Pages from 203 to 214

Other articles by author

Google Scholar

zamknij

Your cart (products: 0)

No products in cart

Your cart Checkout