Czasopisma Naukowe w Sieci (CNS)

On completeness of random transition counts for Markov chains. II

  1. Agnieszka Palma


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.

Pobierz artykuł

Ten artykuł

Probability and Mathematical Statistics

32, z. 2, 2012

Strony od 203 do 214

Inne artykuły autorów

Google Scholar


Twoj koszyk (produkty: 0)

Brak produktów w koszyku

Twój koszyk Do kasy