On the representation of finite multiple Markov chains by weighted circuits (Q1106555)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the representation of finite multiple Markov chains by weighted circuits |
scientific article; zbMATH DE number 4062294
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the representation of finite multiple Markov chains by weighted circuits |
scientific article; zbMATH DE number 4062294 |
Statements
On the representation of finite multiple Markov chains by weighted circuits (English)
0 references
1988
0 references
Circuit processes of any finite order are defined using a finite class of weighted circuits in a finite set. Their study was initiated by \textit{J. MacQueen} [Ann. Probab. 9, 604-610 (1981; Zbl 0464.60070)]. In the present paper, the author fully clarifies MacQueen's treatment by noticing the importance of time reversal in delimiting the class of Markov chains of order r which can be represented as circuit processes of that order.
0 references
Circuit processes of any finite order
0 references
time reversal
0 references
Markov chains
0 references
