seminars:stat:180215 [Department of Mathematics and Statistics, Binghamton University]

This page is read only. You can view the source, but not change it. Ask your administrator if you think this is wrong.

<WRAP centeralign>##Statistics Seminar##\\ Department of Mathematical Sciences</WRAP>

<WRAP 70% center>
^  **DATE:**|Thursday, February 20, 2018 |
^  **TIME:**|1:15pm -- 5:15pm |
^  **LOCATION:**|WH 100E |
^  **SPEAKER:**|Yinsong Chen, Binghamton University |
^  **TITLE:**|The Conductance and Mixing Time |
</WRAP>
\\ 

<WRAP center box 80%>
<WRAP centeralign>**Abstract**</WRAP>
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”.


</WRAP>