Using stopping times to bound mixing times

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1999, Pages

  Pak, Igor ^a  

^a YALE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY VALUE PROBLEMS; GRAPH THEORY; PROBABILITY; SET THEORY; THEOREM PROVING;

CAYLEY GRAPHS; RANDOM WALKS;

MARKOV PROCESSES;

EID: 0032785033     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (8)