Searcharxiv⌕ Search

arXiv subjects

Srijato Bhattacharyya

Publications and source records attributed to Srijato Bhattacharyya.

2 recordsLinked to original sources

DISCCO: Distance-Based Bayesian Spatial Clustering of Complex Objects with Node-Frailty Centrality

Clustering problems increasingly involve complex objects observed over space, such as distributions, matrices, functions, images, or multivariate data, for which a scientifically meaningful dissimilarity between objects is often easier to specify and computationally more tractable than an object-response likelihood model. We propose DISCCO, a Bayesian framework for clustering spatially indexed complex objects using only a pairwise distance matrix and a spatial adjacency graph, with broad applicability and minimal user modeling requirements. The model combines a hierarchical distance-based likelihood accounting for within-cluster compactness and between-cluster separation with a random spatial graph partition prior, ensuring that posterior clusters are spatially contiguous. A key model feature is a set of node-specific frailty parameters that induce dependence among overlapping within-cluster distances and provide posterior summaries of object-level centrality or peripherality within each inferred cluster. We develop a partially collapsed Markov chain Monte Carlo algorithm for posterior inference. Simulations with distribution- and matrix-valued responses show that the proposed spatial distance-clustering framework improves region recovery relative to existing distance-clustering methods, while the frailty layer provides interpretable centrality summaries. Real applications to Houston Census Block Group racial-composition distributions and Western US county-level cancer mortality matrices illustrate how the method recovers interpretable contiguous clusters and frailty-based centrality maps.

stat.ME↗

On Graph-Informed Distance Metrics for Comparing Graph Partitions

Comparing graph partitions is fundamental to the analysis of network-structured data, yet existing measures for comparing graph partitions typically rely on graph-agnostic indices that treat vertices as exchangeable, ignoring the underlying graph topology that encodes essential information about community cohesion and separation. We propose a general construction of graph-informed distances that compares vertex partitions through induced edge partitions and yields valid metrics on the space of contiguous graph partitions. As special cases, we develop graph-informed versions of variation of information and the van Dongen distance together with a binary cut-based companion distance, and show that these distances satisfy a natural local graph-aware refinement criterion. Under stochastic block models, we prove that stronger topological disruptions incur asymptotically larger distances almost surely in both inter-community and intra-community split settings. These results provide a simple and principled framework to compare graph partitions while respecting the underlying graph structure.

stat.ME↗