Sensitivity of mixing times, an example

Itai Benjamini

Sensitivity of mixing times, an example

Itai Benjamini

Department of Mathematics

Weizmann Institute of Science

Research output: Contribution to journal › Article

Abstract

We construct a family of growing finite bounded degree rooted graphs, Gn, in which the mixing time for simple random walk, starting at the root, is order log|Gn|. Yet after a quasi - isometry, the ratio of |Gn| over the mixing time grows arbitrarily slow to infinity.

Original language	English
Article number	2105.05766
Number of pages	5
Journal	arxiv.org
State	Published - 12 May 2021

Access to Document

https://arxiv.org/abs/2105.05766License: Other

Cite this

@article{79e53d3d737d4b41809b5c59ee26e2ad,

title = "Sensitivity of mixing times, an example",

abstract = "We construct a family of growing finite bounded degree rooted graphs, Gn, in which the mixing time for simple random walk, starting at the root, is order log|Gn|. Yet after a quasi - isometry, the ratio of |Gn| over the mixing time grows arbitrarily slow to infinity.",

author = "Itai Benjamini",

year = "2021",

month = may,

day = "12",

language = "الإنجليزيّة",

}

TY - JOUR

T1 - Sensitivity of mixing times, an example

AU - Benjamini, Itai

PY - 2021/5/12

Y1 - 2021/5/12

N2 - We construct a family of growing finite bounded degree rooted graphs, Gn, in which the mixing time for simple random walk, starting at the root, is order log|Gn|. Yet after a quasi - isometry, the ratio of |Gn| over the mixing time grows arbitrarily slow to infinity.

AB - We construct a family of growing finite bounded degree rooted graphs, Gn, in which the mixing time for simple random walk, starting at the root, is order log|Gn|. Yet after a quasi - isometry, the ratio of |Gn| over the mixing time grows arbitrarily slow to infinity.

M3 - مقالة

SN - 2331-8422

JO - arxiv.org

JF - arxiv.org

M1 - 2105.05766

ER -

Sensitivity of mixing times, an example

Abstract

Access to Document

Fingerprint

Cite this