Efficient Learning of Optimal Markov Network Topology with k-Tree Modeling

01/21/2018
by   Liang Ding, et al.
0

The seminal work of Chow and Liu (1968) shows that approximation of a finite probabilistic system by Markov trees can achieve the minimum information loss with the topology of a maximum spanning tree. Our current paper generalizes the result to Markov networks of tree width ≤ k, for every fixed k≥ 2. In particular, we prove that approximation of a finite probabilistic system with such Markov networks has the minimum information loss when the network topology is achieved with a maximum spanning k-tree. While constructing a maximum spanning k-tree is intractable for even k=2, we show that polynomial algorithms can be ensured by a sufficient condition accommodated by many meaningful applications. In particular, we prove an efficient algorithm for learning the optimal topology of higher order correlations among random variables that belong to an underlying linear structure.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/08/2018

Distributed Algorithms for Minimum Degree Spanning Trees

The minimum degree spanning tree (MDST) problem requires the constructio...
research
01/26/2006

Optimal Traffic Networks

Inspired by studies on the airports' network and the physical Internet, ...
research
09/30/2022

A Complete Set of Connectivity-aware Local Topology Manipulation Operations for Robot Swarms

The topology of a robotic swarm affects the convergence speed of consens...
research
07/18/2020

Optimizing Off-Chain Payment Networks in Cryptocurrencies

Off-chain transaction channels represent one of the leading techniques t...
research
01/05/2021

Revisiting the Role of Coverings in Anonymous Networks: Spanning Tree Construction and Topology Recognition

This paper revisits two classical distributed problems in anonymous netw...
research
12/06/2022

Consensus of Double Integrator Multiagent Systems under Nonuniform Sampling and Changing Topology

This article considers consensus problem of multiagent systems with doub...
research
04/01/2018

Fast tree numeration in networks with synchronized time

In this article we present a protocol for building dense numeration in n...

Please sign up or login with your details

Forgot password? Click here to reset