Centrality and topology properties in a tree-structured Markov random field

The topology of the tree underlying a tree-structured Markov random field (MRF) is central to the understanding of its stochastic dynamics: it is, after all, what synthesizes the rich dependence relations within the MRF. In this paper, we shed light on the influence of the tree's topology, through an extensive comparison-based analysis, on the aggregate distribution of the MRF. This is done within the framework of a recently introduced family of tree-structured MRFs with the uncommon property of having fixed Poisson marginal distributions unaffected by the dependence scheme. We establish convex orderings of sums of MRFs encrypted on trees having different topologies, leading to the devising of a new poset of trees. Hasse diagrams, cataloguing trees of dimension up to 9, and methods for the comparison of higher-dimension trees are provided to offer an exhaustive investigation of the new poset. We also briefly discuss its relation to other existing posets of trees and to invariants from spectral graph theory. Such an analysis requires, beforehand, to study the joint distribution of a MRF's component and its sum, a random vector we refer to as a synecdochic pair. To assess if a component is less or more contributing than another to the sum, we employ stochastic orders to compare synecdochic pairs within a MRF. The resulting orderings are reflected through allocation-related quantities, which thus act as centrality indices.
Comment: 22 pages, 12 figures