Verifying the independence of partitions of a probability space

Publisher: Cambridge University Press

E-ISSN: 1755-1633|61|2|263-266

ISSN: 0004-9727

Source: Bulletin of the Australian Mathematical Society, Vol.61, Iss.2, 2000-04, pp. : 263-266

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Let {E1, … Er} and {F1, … Fs} be partitions of a probability space. We exhibit a natural bijection from the set of efficient ways of verifying the independence of such partitions to the set of spanning trees of the complete bipartite graph Kr, s.