Hostname: page-component-586b7cd67f-dlnhk Total loading time: 0 Render date: 2024-11-28T23:30:46.307Z Has data issue: false hasContentIssue false
  • English
  • Français

Verifying the independence of partitions of a probability space

Published online by Cambridge University Press:  17 April 2009

S. B. Mulay  and
C. G. Wagner
S. B. Mulay
Affiliation:
Department of Mathematics, The University of Tennessee, Knoxville, TN 37996-1300, United States of America
C. G. Wagner
Affiliation:
Department of Mathematics, The University of Tennessee, Knoxville, TN 37996-1300, United States of America
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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
Bulletin of the Australian Mathematical Society , Volume 61 , Issue 2 , April 2000 , pp. 263 - 266
Copyright
Copyright © Australian Mathematical Society 2000

References

REFERENCES

[1]Scoins, H., ‘The number of trees with nodes of alternate parity’, Proc. Cambridge Philos. Soc 58 (1962), 12–16.CrossRefGoogle Scholar
[2]Welsh, D., Matroid theory (Academic Press, London, 1976).Google Scholar
[3]West, D., Introduction to graph theory (Prentice Hall, Upper Saddle River, NJ, 1996).Google Scholar