Identity testing of reversible Markov chains

05/13/2021
by   Sela Fried, et al.
0

We consider the problem of identity testing of Markov chains based on a single trajectory of observations under the distance notion introduced by Daskalakis et al. [2018a] and further analyzed by Cherapanamjeri and Bartlett [2019]. Both works made the restrictive assumption that the Markov chains under consideration are symmetric. In this work we relax the symmetry assumption to the more natural assumption of reversibility, still assuming that both the reference and the unknown Markov chains share the same stationary distribution.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/16/2023

A Geometric Reduction Approach for Identity Testing of Reversible Markov Chains

We consider the problem of testing the identity of a reversible Markov c...
research
05/20/2021

On the α-lazy version of Markov chains in estimation and testing problems

We formulate extendibility of the minimax one-trajectory length of sever...
research
02/06/2019

Testing Markov Chains without Hitting

We study the problem of identity testing of markov chains. In this setti...
research
05/05/2021

Identity testing under label mismatch

Testing whether the observed data conforms to a purported model (probabi...
research
02/09/2023

Learning Mixtures of Markov Chains with Quality Guarantees

A large number of modern applications ranging from listening songs onlin...
research
05/26/2023

Irreducibility of Recombination Markov Chains in the Triangular Lattice

In the United States, regions are frequently divided into districts for ...
research
12/07/2022

Modelling Correlated Bernoulli Data Part II: Inference

Binary data are highly common in many applications, however it is usuall...

Please sign up or login with your details

Forgot password? Click here to reset