{"paper":{"title":"Coalescence and meeting times on $n$-block Markov chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"math.PR","authors_text":"Kathleen Lan, Kevin McGoff","submitted_at":"2014-10-01T03:35:24Z","abstract_excerpt":"We consider finite state, discrete-time, mixing Markov chains $(V,P)$, where $V$ is the state space and $P$ is transition matrix. To each such chain $(V,P)$, we associate a sequence of chains $(V_n,P_n)$ by coding trajectories of $(V,P)$ according to their overlapping $n$-blocks. The chain $(V_n,P_n)$, called the $n$-block Markov chain associated to $(V,P)$, may be considered an alternate version of $(V,P)$ having memory of length $n$. Along such a sequence of chains, we characterize the asymptotic behavior of coalescence times and meeting times as $n$ tends to infinity. In particular, we defi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0099","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}