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 ...

When the adjacency matrix is normalized by dividing by the row sums, the largest eigenvalues becomes 1.0. Because Correspondence Analysis does this for symmetric matrices, the sum of the squared ...

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 ...