Compound graphs, a frequently encountered type of data set, have a hierarchical tree structure with parent-child relations (‘inclusion’ relations) and non-hierarchical relations between leaf nodes ...

For Correspondence Analysis, the expecteds are calculated as in chi-square. The result of centering is a cleaner eigen structure that is not contaminated by leakage of information associated with the ...

Together, we extend inferences to applications where the underlying network structure is also latent; that is, the adjacency matrix is unobserved. Here, we consider a Bayesian variant of the matrix ...