Open Access
Translator Disclaimer
August, 1981 Circuit Processes
J. MacQueen
Ann. Probab. 9(4): 604-610 (August, 1981). DOI: 10.1214/aop/1176994365

Abstract

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.

Citation

Download Citation

J. MacQueen. "Circuit Processes." Ann. Probab. 9 (4) 604 - 610, August, 1981. https://doi.org/10.1214/aop/1176994365

Information

Published: August, 1981
First available in Project Euclid: 19 April 2007

zbMATH: 0464.60070
MathSciNet: MR624686
Digital Object Identifier: 10.1214/aop/1176994365

Subjects:
Primary: 60J10
Secondary: 60G10, 60J20

Rights: Copyright © 1981 Institute of Mathematical Statistics

JOURNAL ARTICLE
7 PAGES


SHARE
Vol.9 • No. 4 • August, 1981
Back to Top