Conductance and convergence of Markov chains - A combinatorial treatment of expanders

Annual Symposium on Foundations of Computer Science (Proceedings)

Volumn , Issue , 1989, Pages 526-531

  Mihail, Milena ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES--GRAPH THEORY;

EXPANDERS; IRREVERSIBLE MARKOV CHAINS; MARKOV CHAINS;

PROBABILITY;

EID: 0024772324     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/sfcs.1989.63529     Document Type: Conference Paper

References (14)