05C50 Online Seminar: Sooyeong Kim

  • Date: 02/23/2024
  • Time: 08:00
Sooyeong Kim, York University



When does a random walker move around more rapidly?


Kemeny's constant, a fundamental parameter in the theory of Markov chains, has recently received significant attention within the graph theory community. Originally defined for a discrete, finite, time-homogeneous, and irreducible Markov chain based on its stationary vector and mean first passage times, Kemeny's constant finds special relevance in the study of random walks on graphs. Kemeny's constant gives a measure of how quickly a random walker can move around a graph, and is thus a good measure of the connectivity of a graph. It is natural to study how graph structure informs a graph invariant. In this talk, we will understand how graph structures provide insights into Kemeny’s constant. In addition, we will also examine how the addition of an edge affects Kemeny’s constant.


The slides and a recording of this talk will be shared on the main website.

Other Information: 

The 05C50 Online is an international seminar about graphs and matrices held twice a month on Fridays.


Time: 8AM Pacific/10AM Central 


For more information, visit https://sites.google.com/view/05c50online/home


If you would like to attend, please register using this form to receive the zoom links: https://docs.google.com/forms/d/e/1FAIpQLSdQ98fh58cgeSWzbFe3t77i28FXDck1gYuX9jv_qd4kEf5l_Q/viewform?usp=sf_link