{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XEDXA6BB74EJ6HMMMDZLM7NRBS","short_pith_number":"pith:XEDXA6BB","schema_version":"1.0","canonical_sha256":"b907707821ff089f1d8c60f2b67db10c95b2d9c574d6345e2fadc1db18bbb3e5","source":{"kind":"arxiv","id":"1608.07958","version":1},"attestation_state":"computed","paper":{"title":"On the fastest finite Markov processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Laurent Miclo (IMT), Vivek Borkar (TIFR)","submitted_at":"2016-08-29T09:08:04Z","abstract_excerpt":"Consider a finite irreducible Markov chain with invariant probability $\\pi$. Define its inverse communication speed as the expectation to go from x to y, when x, y are sampled independently according to $\\pi$. In the discrete time setting and when $\\pi$ is the uniform distribution $\\upsilon$, Litvak and Ejov have shown that the permutation matrices associated to Hamiltonian cycles are the fastest Markov chains. Here we prove (A) that the above optimality is with respect to all processes compatible with a fixed graph of permitted transitions (assuming that it does contain a Hamiltonian cycle), "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1608.07958","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-08-29T09:08:04Z","cross_cats_sorted":[],"title_canon_sha256":"48826ead94ec5bd49045601bc1887fa421d1ac16cd387d054957fda278bff24d","abstract_canon_sha256":"e6f90b23c46905845ed9605bad1db0c61a2d089fcb581a0b11d3dc501fca8401"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:49.513205Z","signature_b64":"QTBBp9fsXKghSFktQj5/3HsCM7HIEyojgurF0qUopT1feVC72IlDvuHcgExdaCSq/zfQeLuOR/m/t6c9cn2ZDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b907707821ff089f1d8c60f2b67db10c95b2d9c574d6345e2fadc1db18bbb3e5","last_reissued_at":"2026-05-18T01:07:49.512833Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:49.512833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the fastest finite Markov processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Laurent Miclo (IMT), Vivek Borkar (TIFR)","submitted_at":"2016-08-29T09:08:04Z","abstract_excerpt":"Consider a finite irreducible Markov chain with invariant probability $\\pi$. Define its inverse communication speed as the expectation to go from x to y, when x, y are sampled independently according to $\\pi$. In the discrete time setting and when $\\pi$ is the uniform distribution $\\upsilon$, Litvak and Ejov have shown that the permutation matrices associated to Hamiltonian cycles are the fastest Markov chains. Here we prove (A) that the above optimality is with respect to all processes compatible with a fixed graph of permitted transitions (assuming that it does contain a Hamiltonian cycle), "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.07958","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1608.07958","created_at":"2026-05-18T01:07:49.512897+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.07958v1","created_at":"2026-05-18T01:07:49.512897+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07958","created_at":"2026-05-18T01:07:49.512897+00:00"},{"alias_kind":"pith_short_12","alias_value":"XEDXA6BB74EJ","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XEDXA6BB74EJ6HMM","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XEDXA6BB","created_at":"2026-05-18T12:30:51.357362+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XEDXA6BB74EJ6HMMMDZLM7NRBS","json":"https://pith.science/pith/XEDXA6BB74EJ6HMMMDZLM7NRBS.json","graph_json":"https://pith.science/api/pith-number/XEDXA6BB74EJ6HMMMDZLM7NRBS/graph.json","events_json":"https://pith.science/api/pith-number/XEDXA6BB74EJ6HMMMDZLM7NRBS/events.json","paper":"https://pith.science/paper/XEDXA6BB"},"agent_actions":{"view_html":"https://pith.science/pith/XEDXA6BB74EJ6HMMMDZLM7NRBS","download_json":"https://pith.science/pith/XEDXA6BB74EJ6HMMMDZLM7NRBS.json","view_paper":"https://pith.science/paper/XEDXA6BB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.07958&json=true","fetch_graph":"https://pith.science/api/pith-number/XEDXA6BB74EJ6HMMMDZLM7NRBS/graph.json","fetch_events":"https://pith.science/api/pith-number/XEDXA6BB74EJ6HMMMDZLM7NRBS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XEDXA6BB74EJ6HMMMDZLM7NRBS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XEDXA6BB74EJ6HMMMDZLM7NRBS/action/storage_attestation","attest_author":"https://pith.science/pith/XEDXA6BB74EJ6HMMMDZLM7NRBS/action/author_attestation","sign_citation":"https://pith.science/pith/XEDXA6BB74EJ6HMMMDZLM7NRBS/action/citation_signature","submit_replication":"https://pith.science/pith/XEDXA6BB74EJ6HMMMDZLM7NRBS/action/replication_record"}},"created_at":"2026-05-18T01:07:49.512897+00:00","updated_at":"2026-05-18T01:07:49.512897+00:00"}