|
18 Aralık 2020, 15:00 
Boğaziçi Üniversitesi Matematik Lisansüstü Seminerleri Yunus Emre Demirci In this talk, we consider the following random process in graphs: repeatedly draw edges (with replacement) and with probability $p$ assign the vertices of the edge blue and with probability $1-p$ assign the vertices of the edge red. Edge flipping process generates a random walk on the set of all possible coloring. We will talk about how fast this process converges the stationary distribution. NOT: Zoom Meeting ID: 971 7887 1153 / Passcode: BounMath Matematik İngilizce Zoom İlgili Web Bağlantısı osavk 14.12.2020 |
