No CrossRef data available.
Article contents
Verifying the independence of partitions of a probability space
Published online by Cambridge University Press: 17 April 2009
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.
- Type
- Research Article
- Information
- Copyright
- Copyright © Australian Mathematical Society 2000