Monday October 20th at 4.30pm

this, we present a new upper bound on the mixing time of an aperiodic Markov chain on a graph, which requires a new definition

of the notion of conductance. We apply this bound determining the (newly defined) conductance of the largest component of a

sparse random graph. (This is joint work with B.A. Reed.)