{"paper":{"title":"Efficient Coupling for Random Walk with Redistribution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Elizabeth Tripp, Hugo Panzo, Iddo Ben-Ari","submitted_at":"2014-10-30T02:40:51Z","abstract_excerpt":"What can one say on convergence to stationarity of a finite state Markov chain that behaves \"locally\" like a nearest neighbor random walk on ${\\mathbb Z}$ ? The model we consider is a version of nearest neighbor lazy random walk on the state space $ \\{0,\\dots,N\\}$: the probability for staying put at each site is $\\frac 12$, the transition to the nearest neighbors, one on the right and one on the left, occurs with probability $\\frac14$ each, where we identify two sites, $J_0$ and $J_N$ as, respectively, the neighbor of $0$ from the left and the neighbor of $N$ from the right (but $0$ is not a n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.8234","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"}