{"paper":{"title":"Random walks on dynamic configuration models: a trichotomy","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":"2018-03-13T14:16:19Z","abstract_excerpt":"We consider a dynamic random graph on $n$ vertices that is obtained by starting from a random graph generated according to the configuration model with a prescribed degree sequence and at each unit of time randomly rewiring a fraction $\\alpha_n$ of the edges. We are interested in the mixing time of a random walk without backtracking on this dynamic random graph in the limit as $n\\to\\infty$, when $\\alpha_n$ is chosen such that $\\lim_{n\\to\\infty} \\alpha_n (\\log n)^2 = \\beta \\in [0,\\infty]$. In [1] we found that, under mild regularity conditions on the degree sequence, the mixing time is of order"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04824","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"}