{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:58:33Z","timestamp":1743011913280,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031382703"},{"type":"electronic","value":"9783031382710"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-38271-0_32","type":"book-chapter","created":{"date-parts":[[2023,7,31]],"date-time":"2023-07-31T14:02:16Z","timestamp":1690812136000},"page":"328-337","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Geometric Reduction for\u00a0Identity Testing of\u00a0Reversible Markov Chains"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5388-7640","authenticated-orcid":false,"given":"Geoffrey","family":"Wolfer","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1121-8633","authenticated-orcid":false,"given":"Shun","family":"Watanabe","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,1]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"Canonne, C.L., et al.: Topics and techniques in distribution testing: A biased but representative sample. Found. Trends Commun. Inf. Theor. 19(6), 1032\u20131198 (2022)","DOI":"10.1561\/0100000114"},{"key":"32_CR2","unstructured":"Chan, S.O., Ding, Q., Li, S.H.: Learning and testing irreducible Markov chains via the $$k$$-cover time. In: Algorithmic Learning Theory. pp. 458\u2013480. PMLR (2021)"},{"key":"32_CR3","unstructured":"Cherapanamjeri, Y., Bartlett, P.L.: Testing symmetric Markov chains without hitting. In: Proceedings of the Thirty-Second Conference on Learning Theory. Proceedings of Machine Learning Research, vol. 99, pp. 758\u2013785. PMLR (2019)"},{"key":"32_CR4","unstructured":"Daskalakis, C., Dikkala, N., Gravin, N.: Testing symmetric Markov chains from a single trajectory. In: Conference On Learning Theory. pp. 385\u2013409. PMLR (2018)"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Diakonikolas, I., Kane, D.M.: A new approach for testing properties of discrete distributions. In: 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS). pp. 685\u2013694. IEEE (2016)","DOI":"10.1109\/FOCS.2016.78"},{"key":"32_CR6","unstructured":"Fried, S., Wolfer, G.: Identity testing of reversible Markov chains. In: Proceedings of The 25th International Conference on Artificial Intelligence and Statistics. Proceedings of Machine Learning Research, vol. 151, pp. 798\u2013817. PMLR (2022)"},{"key":"32_CR7","unstructured":"Goldreich, O.: The uniform distribution is complete with respect to testing identity to a fixed distribution. In: Electron. Colloquium Comput. Complex. vol. 23, p. 15 (2016)"},{"issue":"4","key":"32_CR8","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.1214\/15-AOS1420","volume":"44","author":"M Hayashi","year":"2016","unstructured":"Hayashi, M., Watanabe, S.: Information geometry approach to parameter estimation in Markov chains. Ann. Stat. 44(4), 1495\u20131535 (2016)","journal-title":"Ann. Stat."},{"issue":"6","key":"32_CR9","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1109\/TIT.1978.1055967","volume":"24","author":"D Kazakos","year":"1978","unstructured":"Kazakos, D.: The Bhattacharyya distance and detection between Markov chains. IEEE Trans. Inf. Theor. 24(6), 747\u2013754 (1978)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"32_CR10","unstructured":"Kemeny, J.G., Snell, J.L.: Finite Markov chains: with a new appendix Generalization of a fundamental matrix. Springer (1983)"},{"key":"32_CR11","unstructured":"Nagaoka, H.: The exponential family of Markov chains and its information geometry. In: The proceedings of the Symposium on Information Theory and Its Applications. vol. 28(2), pp. 601\u2013604 (2005)"},{"issue":"10","key":"32_CR12","doi-asserted-by":"publisher","first-page":"4750","DOI":"10.1109\/TIT.2008.928987","volume":"54","author":"L Paninski","year":"2008","unstructured":"Paninski, L.: A coincidence-based test for uniformity given very sparsely sampled discrete data. IEEE Trans. Inf. Theor. 54(10), 4750\u20134755 (2008)","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"4","key":"32_CR13","doi-asserted-by":"publisher","first-page":"1553","DOI":"10.1109\/18.923736","volume":"47","author":"Z Rached","year":"2001","unstructured":"Rached, Z., Alajaji, F., Campbell, L.L.: R\u00e9nyi\u2019s divergence and entropy rates for finite alphabet Markov sources. IEEE Trans. Inf. Theor. 47(4), 1553\u20131561 (2001)","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"1","key":"32_CR14","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1137\/151002526","volume":"46","author":"G Valiant","year":"2017","unstructured":"Valiant, G., Valiant, P.: An automatic inequality prover and instance optimal identity testing. SIAM J. Comput. 46(1), 429\u2013455 (2017)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"32_CR15","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1080\/02331887808801428","volume":"9","author":"NN \u010cencov","year":"1978","unstructured":"\u010cencov, N.N.: Algebraic foundation of mathematical statistics. Series Stat. 9(2), 267\u2013276 (1978)","journal-title":"Series Stat."},{"key":"32_CR16","unstructured":"\u010cencov, N.N.: Statistical decision rules and optimal inference, transl. math. monographs, vol. 53. Amer. Math. Soc., Providence-RI (1981)"},{"key":"32_CR17","doi-asserted-by":"crossref","unstructured":"Waggoner, B.: $$l_p$$ testing and learning of discrete distributions. In: Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science. pp. 347\u2013356 (2015)","DOI":"10.1145\/2688073.2688095"},{"key":"32_CR18","unstructured":"Wolfer, G., Kontorovich, A.: Minimax testing of identity to a reference ergodic Markov chain. In: Proceedings of the Twenty Third International Conference on Artificial Intelligence and Statistics. vol. 108, pp. 191\u2013201. PMLR (2020)"},{"key":"32_CR19","doi-asserted-by":"crossref","unstructured":"Wolfer, G., Watanabe, S.: Information geometry of reversible Markov chains. Inf. Geom. 4(2), 393\u2013433 (12 2021)","DOI":"10.1007\/s41884-021-00061-7"},{"key":"32_CR20","unstructured":"Wolfer, G., Watanabe, S.: Geometric aspects of data-processing of Markov chains (2022), arXiv:2203.04575"}],"container-title":["Lecture Notes in Computer Science","Geometric Science of Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-38271-0_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,25]],"date-time":"2024-10-25T11:08:45Z","timestamp":1729854525000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38271-0_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031382703","9783031382710"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38271-0_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"1 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GSI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Geometric Science of Information","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"St. Malo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gsi2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/gsi2023.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"161","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"125","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"78% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}