{"paper":{"title":"Mixing of the symmetric exclusion processes in terms of the corresponding single-particle random walk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Roberto Imbuzeiro Oliveira","submitted_at":"2010-07-15T22:30:06Z","abstract_excerpt":"We prove an upper bound for the $\\varepsilon$-mixing time of the symmetric exclusion process on any graph G, with any feasible number of particles. Our estimate is proportional to $\\mathsf{T}_{\\mathsf{RW}(G)}\\ln(|V|/\\varepsilon)$, where |V| is the number of vertices in G, and $\\mathsf{T}_{\\mathsf{RW}(G)}$ is the 1/4-mixing time of the corresponding single-particle random walk. This bound implies new results for symmetric exclusion on expanders, percolation clusters, the giant component of the Erdos-Renyi random graph and Poisson point processes in $\\mathbb{R}^d$. Our technical tools include a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.2669","kind":"arxiv","version":3},"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"}