On the Edges of Characteristic Imset Polytopes

09/15/2022
by   Svante Linusson, et al.
0

The edges of the characteristic imset polytope, CIM_p, were recently shown to have strong connections to causal discovery as many algorithms could be interpreted as greedy restricted edge-walks, even though only a strict subset of the edges are known. To better understand the general edge structure of the polytope we describe the edge structure of faces with a clear combinatorial interpretation: for any undirected graph G we have the face CIM_G, the convex hull of the characteristic imsets of DAGs with skeleton G. We give a full edge-description of CIM_G when G is a tree, leading to interesting connections to other polytopes. In particular the well-studied stable set polytope can be recovered as a face of CIM_G when G is a tree. Building on this connection we are also able to give a description of all edges of CIM_G when G is a cycle, suggesting possible inroads for generalization. We then introduce an algorithm for learning directed trees from data, utilizing our newly discovered edges, that outperforms classical methods on simulated Gaussian data.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/19/2019

Some Polycubes Have No Edge-Unzipping

It is unknown whether or not every polycube has an edge-unfolding. A pol...
research
03/05/2021

Greedy Causal Discovery is Geometric

Finding a directed acyclic graph (DAG) that best encodes the conditional...
research
07/09/2018

An Interesting Structural Property Related to the Problem of Computing All the Best Swap Edges of a Tree Spanner in Unweighted Graphs

In this draft we prove an interesting structural property related to the...
research
04/18/2023

Parallel Greedy Spanners

A t-spanner of a graph is a subgraph that t-approximates pairwise distan...
research
03/31/2018

On Attractors of Isospectral Compressions of Networks

In the recently developed theory of isospectral transformations of netwo...
research
09/05/2022

Toric Ideals of Characteristic Imsets via Quasi-Independence Gluing

Characteristic imsets are 0-1 vectors which correspond to Markov equival...
research
02/10/2020

Introducing Graph Cumulants: What is the Kurtosis of your Social Network?

In an increasingly interconnected world, understanding and summarizing t...

Please sign up or login with your details

Forgot password? Click here to reset