A Geometric Reduction Approach for Identity Testing of Reversible Markov Chains

02/16/2023
by   Geoffrey Wolfer, et al.
0

We consider the problem of testing the identity of a reversible Markov chain against a reference from a single trajectory of observations. Employing the recently introduced notion of a lumping-congruent Markov embedding, we show that, at least in a mildly restricted setting, testing identity to a reversible chain reduces to testing to a symmetric chain over a larger state space and recover state-of-the-art sample complexity for the problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/13/2021

Identity testing of reversible Markov chains

We consider the problem of identity testing of Markov chains based on a ...
research
08/06/2018

Statistical Windows in Testing for the Initial Distribution of a Reversible Markov Chain

We study the problem of hypothesis testing between two discrete distribu...
research
02/22/2018

Entropy Rate Estimation for Markov Chains with Large State Space

Estimating the entropy based on data is one of the prototypical problems...
research
03/07/2023

Systematic approaches to generate reversiblizations of Markov chains

Given a target distribution π and an arbitrary Markov infinitesimal gene...
research
01/31/2019

Minimax Testing of Identity to a Reference Ergodic Markov Chain

We exhibit an efficient procedure for testing, based on a single long st...
research
12/14/2019

Mixing Time Estimation in Ergodic Markov Chains from a Single Trajectory with Contraction Methods

The mixing time t_mix of an ergodic Markov chain measures the rate of co...
research
06/15/2018

Computationally Efficient Estimation of the Spectral Gap of a Markov Chain

We consider the problem of estimating from sample paths the absolute spe...

Please sign up or login with your details

Forgot password? Click here to reset