Verifying the independence of partitions of a probability space

被引:0
|
作者
Mulay, SB [1 ]
Wagner, CG [1 ]
机构
[1] Univ Tennessee, Dept Math, Knoxville, TN 37996 USA
关键词
D O I
10.1017/S0004972700022255
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Let {E-1,...,E-r} and {F-1,...,F-s} 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 K-r,K-s.
引用
收藏
页码:263 / 266
页数:4
相关论文
共 50 条