Variation of information for all split pairings

Calculate the variation of clustering information Meila2007TreeDist for each possible pairing of non-trivial splits on n leaves SmithDistTreeDist, tabulating the number of pairings with each similarity.

Usage

AllSplitPairings(n)

Arguments

n

Integer specifying the number of leaves in a tree.

Value

AllSplitPairings() returns a named vector. The name of each element corresponds to a certain variation of information, in bits; the value of each element specifies the number of pairings of non-trivial splits that give rise to that variation of information. Split AB|CD is treated as distinct from CD|AB. If pairing AB|CD=CD|AB is considered equivalent to CD|AB=CD|AB (etc), then values should be divided by four.

References

Author

Martin R. Smith (martin.smith@durham.ac.uk)

Examples

AllSplitPairings(6)
#>                0                1 1.33333333333333 1.74837083261218 
#>              100              480              360              480 
#> 1.83659166810898 1.91829583405449 
#>              360              720 
# Treat equivalent splits as identical by dividing by four:
AllSplitPairings(6) / 4L
#>                0                1 1.33333333333333 1.74837083261218 
#>               25              120               90              120 
#> 1.83659166810898 1.91829583405449 
#>               90              180