Mixing Time Bounds via the Spectral Profile
نویسندگان
چکیده
منابع مشابه
Mixing Time Bounds via the Spectral Profile Sharad Goel, Ravi Montenegro and Prasad Tetali
On complete, non-compact manifolds and infinite graphs, FaberKrahn inequalities have been used to estimate the rate of decay of the heat kernel. We develop this technique in the setting of finite Markov chains, proving upper and lower L mixing time bounds via the spectral profile. This approach lets us recover and refine previous conductance-based bounds of mixing time (including the Morris-Per...
متن کاملSharp Bounds on the PI Spectral Radius
In this paper some upper and lower bounds for the greatest eigenvalues of the PI and vertex PI matrices of a graph G are obtained. Those graphs for which these bounds are best possible are characterized.
متن کاملsharp bounds on the pi spectral radius
in this paper some upper and lower bounds for the greatest eigenvalues of the pi and vertex pimatrices of a graph g are obtained. those graphs for which these bounds are best possible arecharacterized.
متن کاملMixing time bounds for overlapping cycles shuffles
Consider a deck of n cards. Let p1, p2, . . . , pn be a probability vector and consider the mixing time of the card shuffle which at each step of time picks a position according to the pi’s and move the card in that position to the top. This setup was introduced in [5], where a few special cases were studied. In particular the case pn−k = pn = 1/2, k = Θ(n), turned out to be challenging and onl...
متن کاملBounding the mixing time via coupling
It is convenient to transform G to a directed graph ←→ G , and look at absorbences of G. From G, we form ←→ G by replacing each edge (u, v) by a pair of anti-parallel edges −→ uv and −→ vu. An absorbence rooted at a vertex r of a directed graph is a subset S of edges, such that |S| = |V | − 1 and every vertex, except r, has exactly one edge directed away from it, thus S forms a tree rooted at r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Probability
سال: 2006
ISSN: 1083-6489
DOI: 10.1214/ejp.v11-300