Open Access
Translator Disclaimer
February, 1984 Urn Models for Markov Exchangeability
Arif Zaman
Ann. Probab. 12(1): 223-229 (February, 1984). DOI: 10.1214/aop/1176993385

Abstract

Markov exchangeability, a generalization of exchangeability that was proposed by de Finetti, requires that a probability on a string of letters be constant on all strings which have the same initial letter and the same transition counts. The set of Markov exchangeable measures forms a convex set. A graph theoretic and an urn interpretation of the extreme points of this convex set is given.

Citation

Download Citation

Arif Zaman. "Urn Models for Markov Exchangeability." Ann. Probab. 12 (1) 223 - 229, February, 1984. https://doi.org/10.1214/aop/1176993385

Information

Published: February, 1984
First available in Project Euclid: 19 April 2007

zbMATH: 0542.60065
MathSciNet: MR723741
Digital Object Identifier: 10.1214/aop/1176993385

Subjects:
Primary: 60J10
Secondary: 05C35, 62A15

Rights: Copyright © 1984 Institute of Mathematical Statistics

JOURNAL ARTICLE
7 PAGES


SHARE
Vol.12 • No. 1 • February, 1984
Back to Top