Witnessing subsystems for probabilistic systems with low tree width

by   Simon Jantsch, et al.

A standard way of justifying that a certain probabilistic property holds in a system is to provide a witnessing subsystem (also called critical subsystem) for the property. Computing minimal witnessing subsystems is NP-hard already for acyclic Markov chains, but can be done in polynomial time for Markov chains whose underlying graph is a tree. This paper considers the problem for probabilistic systems that are similar to trees or paths. It introduces the parameters directed tree-partition width (dtpw) and directed path-partition width (dppw) and shows that computing minimal witnesses remains NP-hard for Markov chains with bounded dppw (and hence also for Markov chains with bounded dtpw). By observing that graphs of bounded dtpw have bounded width with respect to all known tree similarity measures for directed graphs, the hardness result carries over to these other tree similarity measures. Technically, the reduction proceeds via the conceptually simpler matrix-pair chain problem, which is introduced and shown to be NP-complete for nonnegative matrices of fixed dimension. Furthermore, an algorithm which aims to utilise a given directed tree partition of the system to compute a minimal witnessing subsystem is described. It enumerates partial subsystems for the blocks of the partition along the tree order, and keeps only necessary ones. A preliminary experimental analysis shows that it outperforms other approaches on certain benchmarks which have directed tree partitions of small width.



There are no comments yet.


page 1

page 2

page 3

page 4


Parametrised Algorithms for Directed Modular Width

Many well-known NP-hard algorithmic problems on directed graphs resist e...

Directed branch-width: A directed analogue of tree-width

We introduce a new digraph width measure called directed branch-width. T...

Computing the Fréchet distance of trees and graphs of bounded tree width

We give algorithms to compute the Fréchet distance of trees and graphs w...

Computing directed path-width and directed tree-width of recursively defined digraphs

In this paper we consider the directed path-width and directed tree-widt...

Generalisations of Matrix Partitions : Complexity and Obstructions

A trigraph is a graph where each pair of vertices is labelled either 0 (...

Shepherding Hordes of Markov Chains

This paper considers large families of Markov chains (MCs) that are defi...

Maximum Likelihood Bounded Tree-Width Markov Networks

Chow and Liu (1968) studied the problem of learning a maximumlikelihood ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.