Department of Mathematics and Statistics, Binghamton University

User Tools

Site Tools

You are here: Homepage » Colloquium, Seminars, Lectures, and Conferences » Statistics Seminar » 180215
seminars:stat:180215

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision		Previous revision
seminars:stat:180215 [2018/02/14 15:06] – qyuseminars:stat:180215 [2018/02/16 14:50] (current) – qyu
Line 1: Line 1:
 +<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>
 +
 +
 +
 +