Department of Mathematics and Statistics, Binghamton University seminars:datscihttp://www2.math.binghamton.edu/2026-06-27T23:31:23-04:00FeedCreator 1.7.2-ppt DokuWikiseminars:datsci:1802202018-02-16T13:04:42-04:002018-02-16T13:04:42-04:00http://www2.math.binghamton.edu/p/seminars/datsci/180220<!-- EDIT1 PLUGIN_WRAP_START [0-] --><div class="wrap_centeralign plugin_wrap">
<p>
<span style='font-size:120%;'>Statistics Seminar</span><br/>
Department of Mathematical Sciences
</p>
</div><!-- EDIT2 PLUGIN_WRAP_END [0-] --><!-- EDIT3 PLUGIN_WRAP_START [0-] --><div class="wrap_center plugin_wrap" style="width:70%;"><div class="table sectionedit5"><table class="inline">
<tr class="row0">
<th class="col0 rightalign"> <strong>DATE:</strong></th><td class="col1">Tuesday, February 20, 2018 </td>
</tr>
<tr class="row1">
<th class="col0 rightalign"> <strong>TIME:</strong></th><td class="col1">12:05pm – 1:05pm </td>
</tr>
<tr class="row2">
<th class="col0 rightalign"> <strong>LOCATION:</strong></th><td class="col1">WH 100E </td>
</tr>
<tr class="row3">
<th class="col0 rightalign"> <strong>SPEAKER:</strong></th><td class="col1">Yinsong Chen, Binghamton University </td>
</tr>
<tr class="row4">
<th class="col0 rightalign"> <strong>TITLE:</strong></th><td class="col1">The Conductance and Mixing Time </td>
</tr>
</table></div>
<!-- EDIT5 TABLE [106-309] --></div><!-- EDIT4 PLUGIN_WRAP_END [0-] -->
<p>
<br/>
</p>
<!-- EDIT6 PLUGIN_WRAP_START [0-] --><div class="wrap_center wrap_box plugin_wrap" style="width:80%;"><!-- EDIT8 PLUGIN_WRAP_START [0-] --><div class="wrap_centeralign plugin_wrap">
<p>
<strong>Abstract</strong>
</p>
</div><!-- EDIT9 PLUGIN_WRAP_END [0-] -->
<p>
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”.
</p>
</div><!-- EDIT7 PLUGIN_WRAP_END [0-] -->