On mixing times for stratified walks on the d-cube

Authors:
Nancy Garcia;José Luis Palacios
Affiliations:
Universidade Estadual de Campinas, Campinas, Brazil;Universidad Simón Bolívar, Caracas, Venezuela
Venue:
Random Structures & Algorithms
Year:
2002

Citing 3
Cited 1

The electrical resistance of a graph captures its commute and cover times

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A tight lower bound on the cover time for random walks on graphs

Random Structures & Algorithms
Stratified random walks on the n-cube

Random Structures & Algorithms

On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics

Combinatorics, Probability and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Using the electric and coupling approaches, we derive a series of results concerning the mixing times for the stratified random walk on the d-cube, inspired in the results of Chung and Graham (1997) [Random Struct. Alg., 11, 199-122].