Hidden Markov Modeling over Graphs

11/26/2021
by   Mert Kayaalp, et al.
0

This work proposes a multi-agent filtering algorithm over graphs for finite-state hidden Markov models (HMMs), which can be used for sequential state estimation or for tracking opinion formation over dynamic social networks. We show that the difference from the optimal centralized Bayesian solution is asymptotically bounded for geometrically ergodic transition models. Experiments illustrate the theoretical findings and in particular, demonstrate the superior performance of the proposed algorithm compared to a state-of-the-art social learning algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/05/2022

Distributed Bayesian Learning of Dynamic States

This work studies networked agents cooperating to track a dynamical stat...
research
04/11/2012

A Simple Explanation of A Spectral Algorithm for Learning Hidden Markov Models

A simple linear algebraic explanation of the algorithm in "A Spectral Al...
research
03/04/2020

Large-Scale Shrinkage Estimation under Markovian Dependence

We consider the problem of simultaneous estimation of a sequence of depe...
research
02/14/2012

Compressed Inference for Probabilistic Sequential Models

Hidden Markov models (HMMs) and conditional random fields (CRFs) are two...
research
12/16/2012

Probability Bracket Notation: Markov State Chain Projector, Hidden Markov Models and Dynamic Bayesian Networks

After a brief discussion of Markov Evolution Formula (MEF) expressed in ...
research
07/23/2019

Hidden Markov Models derived from Behavior Trees

Behavior trees are rapidly attracting interest in robotics and human tas...
research
01/26/2022

Infrared and visible image fusion based on Multi-State Contextual Hidden Markov Model

The traditional two-state hidden Markov model divides the high frequency...

Please sign up or login with your details

Forgot password? Click here to reset