{"paper":{"title":"Mixing times of random walks on dynamic configuration models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Frank den Hollander, Hakan Guldas, Luca Avena, Remco van der Hofstad","submitted_at":"2016-06-24T10:58:43Z","abstract_excerpt":"The mixing time of a random walk, with or without backtracking, on a random graph generated according to the configuration model on $n$ vertices, is known to be of order $\\log n$. In this paper we investigate what happens when the random graph becomes {\\em dynamic}, namely, at each unit of time a fraction $\\alpha_n$ of the edges is randomly rewired. Under mild conditions on the degree sequence, guaranteeing that the graph is locally tree-like, we show that for every $\\varepsilon\\in(0,1)$ the $\\varepsilon$-mixing time of random walk without backtracking grows like $\\sqrt{2\\log(1/\\varepsilon)/\\l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.07639","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"}