A representation of exchangeable hierarchies by sampling from real trees
arXiv:1101.5619
Abstract
A hierarchy on a set , also called a total partition of , is a collection of subsets of such that , each singleton subset of belongs to , and if then equals either or or . Every exchangeable random hierarchy of positive integers has the same distribution as a random hierarchy associated as follows with a random real tree equipped with root element and a random probability distribution on the Borel subsets of : given , let be independent and identically distributed according to , and let comprise all singleton subsets of , and every subset of the form as ranges over , where is the fringe subtree of rooted at . There is also the alternative characterization: every exchangeable random hierarchy of positive integers has the same distribution as a random hierarchy derived as follows from a random hierarchy on and a family of IID uniform [0,1] random variables independent of : let comprise all sets of the form as ranges over the members of .
29 pages, 6 figures