The Complexity of Finding and Enumerating Optimal Subgraphs to Represent Spatial Correlation

Abstract

AbstractUnderstanding spatial correlation is vital in many fields including epidemiology and social science. Lee et al. (Stat Comput 31(4):51, 2021. https://doi.org/10.1007/s11222-021-10025-7) recently demonstrated that improved inference for areal unit count data can be achieved by carrying out modifications to a graph representing spatial correlations; specifically, they delete edges of the planar graph derived from border-sharing between geographic regions in order to maximise a specific objective function. In this paper, we address the computational complexity of the associated graph optimisation problem. We demonstrate that this optimisation problem is NP-hard; we further show intractability for two simpler variants of the problem. We follow these results with two parameterised algorithms that exactly solve the problem. The first is parameterised by both treewidth and maximum degree, while the second is parameterised by the maximum number of edges that can be removed and is also restricted to settings where the input graph has maximum degree three. Both of these algorithms solve not only the decision problem, but also enumerate all solutions with polynomial time precalculation, delay, and postcalculation time in respective restricted settings. For this problem, efficient enumeration allows the uncertainty in the spatial correlation to be utilised in the modelling. The first enumeration algorithm utilises dynamic programming on a tree decomposition of the input graph, and has polynomial time precalculation and linear delay if both the treewidth and maximum degree are bounded. The second algorithm is restricted to problem instances with maximum degree three, as may arise from triangulations of planar surfaces, but can output all solutions with FPT precalculation time and linear delay when the maximum number of edges that can be removed is taken as the parameter.