Circuit Processes
MacQueen, J.
Ann. Probab., Tome 9 (1981) no. 6, p. 604-610 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
Circuit processes of order $r$ are defined using a finite class of weighted circuits in a finite set $S$. The probability of the next value of the process is made proportional to the total weight of those circuits in the class which pass through the value in question and the last $r$ values. The process is an order $r$ Markov chain in $S$, and the stationary distribution is easily calculated. Also, it is shown that all stationary order $r$ Markov chains in a finite set can be represented as circuit processes of that order.
Publié le : 1981-08-14
Classification:  05-60,  Markov,  stationary distribution,  graph,  circuit,  60J10,  60G10,  60J20 
@article{1176994365,
     author = {MacQueen, J.},
     title = {Circuit Processes},
     journal = {Ann. Probab.},
     volume = {9},
     number = {6},
     year = {1981},
     pages = { 604-610},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1176994365}
}

MacQueen, J. Circuit Processes. Ann. Probab., Tome 9 (1981) no. 6, pp.  604-610. http://gdmltest.u-ga.fr/item/1176994365/