Recently, Cuntz and Kühne introduced a particular class of hyperplane arrangements stemming from a given graph G, so called connected subgraph arrangements AG. In this note we strengthen some of the result from their work and prove new ones for members of this class. For instance, we show that aspherical members withing this class stem from a rather restricted set of graphs. Specifically, if AG is an aspherical connected subgraph arrangement, then AG is free with the unique possible exception when the underlying graph G is the complete graph on 4 nodes.

For the distributions of finitely many binary random variables, we study the interaction of restrictions of the supports with conditional independence constraints. We prove a generalization of the Hammersley-Clifford theorem for distributions whose support is a natural distributive lattice: that is, any distribution which has natural lattice support and satisfies the pairwise Markov statements of a graph must factor according to the graph. We also show a connection to the Hibi ideals of lattices. dui fames leo sodales risus, posuere justo curae nostra, luctus vitae montes potenti, lectus sem.