User Tools

Site Tools


Statistics Seminar
Department of Mathematical Sciences

DATE:Thursday, February 20, 2018
TIME:1:15pm – 5:15pm
SPEAKER:Yinsong Chen, Binghamton University
TITLE:The Conductance and Mixing Time


The conductance of a graph can be used to provide both upper and lower bound of the mixing time. I will talk about the basic theorem for the bound and serval examples. An artificial glued graph and the rectangle tiling will be included in the application for lower bound. The example random walk on hyper cube will be concerned for upper bound to provide the idea that we can lower bound the conductance by “counting the max number of path passing through an edge”.

seminars/stat/180215.txt · Last modified: 2018/02/16 09:50 by qyu