{"paper":{"title":"Hitting time, access time and optimal transport on graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Michael C.H. Choi","submitted_at":"2018-07-20T07:21:04Z","abstract_excerpt":"Given a discrete source distribution $\\mu$ and discrete target distribution $\\nu$ on a common finite state space $\\mathcal{X}$, we are tasked with transporting $\\mu$ to $\\nu$ using a given discrete-time Markov chain $X$ with the quickest possible time on average. We define the optimal transport time $H(\\mu,\\nu)$ as stopping rule of $X$ that gives the minimial expected transport time. This is also known as the access time from $\\mu$ to $\\nu$ of $X$ in [L. Lov\\'{a}sz and P. Winkler. Efficient Stopping Rules for Markov Chains. Proceedings of the Twenty-seventh Annual ACM Symposium on Theory of Co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07721","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"}