Geometric reduction for identity testing of reversible Markov chains

DOI10.1007/978-3-031-38271-0_32arXiv2302.08059OpenAlexW4385435109MaRDI QIDQ6138133

Geoffrey Wolfer, Shun Watanabe

Publication date: 16 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2302.08059

zbMATH Keywords

irreducible Markov chainsinformation geometrylumpabilityidentity testingMarkov embeddingcongruent embedding

Mathematics Subject Classification ID

Markov processes: hypothesis testing (62M02)

Cites Work

• Unnamed Item
• Information geometry approach to parameter estimation in Markov chains
• Information geometry of reversible Markov chains
• An Automatic Inequality Prover and Instance Optimal Identity Testing
• L _p Testing and Learning of Discrete Distributions
• A Coincidence-Based Test for Uniformity Given Very Sparsely Sampled Discrete Data
• Algebraic foundation of mathematical statistics²
• The Bhattacharyya distance and detection between Markov chains
• Renyi's divergence and entropy rates for finite alphabet Markov sources
• The Uniform Distribution Is Complete with Respect to Testing Identity to a Fixed Distribution
• Topics and Techniques in Distribution Testing: A Biased but Representative Sample

This page was built for publication: Geometric reduction for identity testing of reversible Markov chains