Bayesian graph-informed random partition models are widely used to model heterogeneity in structured data. A prominent approach assigns a prior directly on the space of contiguous partitions of a pre-determined graph G; however, such models are not data-adaptive and can be computationally infeasible for large graphs. To address these limitations, we propose a Bayesian adaptive quotient graph framework that induces partitions through a two-level hierarchical prior: a prior is first imposed on quotient graphs of G, followed by a conditional prior on a reduced contiguous partition space induced by each quotient graph. We develop high-level assumptions that guide the construction of the two-level prior such that the reduced space retains desirable partitions. We further establish high-level assumptions for posterior concentration on desirable quotient graphs and partitions. The framework can be readily embedded into many existing Bayesian hierarchical models with latent cluster structures as a contiguous random partition prior. As a specific example, we apply the proposed framework to the spatial random partition model proposed in Huang and Sang (2026). The resulting model adapts to the unknown number of clusters, achieves a faster clustering-consistency contraction rate, and yields substantially lower partition error and computation time in simulations. Finally, we apply the resulting model to a large spatial transcriptomics dataset to demonstrate its practical utility.
翻译:暂无翻译