Observability Properties of Colored Graphs

11/09/2018
by   Mark Chilenski, et al.
0

A colored graph is a directed graph in which either nodes or edges have been assigned colors that are not necessarily unique. Observability problems in such graphs are concerned with whether an agent observing the colors of edges or nodes traversed on a path in the graph can determine which node they are at currently or which nodes they have visited earlier in the path traversal. Previous research efforts have identified several different notions of observability as well as the associated properties of colored graphs for which those types of observability properties hold. This paper unifies the prior work into a common framework with several new analytic results about relationships between those notions and associated graph properties. The new framework provides an intuitive way to reason about the attainable path reconstruction accuracy as a function of lag and time spent observing, and identifies simple modifications that improve the observability properties of a given graph. This intuition is borne out in a series of numerical experiments. This work has implications for problems that can be described in terms of an agent traversing a colored graph, including the reconstruction of hidden states in a hidden Markov model (HMM).

READ FULL TEXT

page 5

page 6

page 7

research
04/29/2021

Lower Bounds and properties for the average number of colors in the non-equivalent colorings of a graph

We study the average number 𝒜(G) of colors in the non-equivalent colorin...
research
02/26/2020

On Learning a Hidden Directed Graph with Path Queries

In this paper, we consider the problem of reconstructing a directed grap...
research
08/25/2022

The thickness of fan-planar graphs is at most three

We prove that in any strongly fan-planar drawing of a graph G the edges ...
research
05/24/2013

Flooding edge or node weighted graphs

Reconstruction closings have all properties of a physical flooding of a ...
research
11/26/2019

Flexible graph matching and graph edit distance using answer set programming

The graph isomorphism, subgraph isomorphism, and graph edit distance pro...
research
04/27/2012

The conduciveness of CA-rule graphs

Given two subsets A and B of nodes in a directed graph, the conducivenes...
research
09/23/2020

Kirchhoff's Circuit Law Applications to Graph Simplification in Search Problems

This paper proposes a new analysis of graph using the concept of electri...

Please sign up or login with your details

Forgot password? Click here to reset