BodyText1
In fall 2021, the Discrete Mathematics/Algebra Seminar will meet on Thursdays at 1-2 p.m. The organizers are Novi Bong and Sebastian Cioaba. The seminar will be mostly online and the in-person meetings will be announced on this webpage.​​​
| Quentin Dubroff, Rutgers | 214 | Quentin Dubroff, Rutgers | | <p><span class="wrap-text"><strong>Title:</strong> Linear cover time is exponentially unlikely<br><strong>Abstract:</strong>
The cover time of a random walk on a graph G is the first time the walk
has visited every vertex of G. A fundamental result of Feige shows that
for any (simple, n-vertex) graph, the expected cover time is at least
(1+o(1))n log n. Benjamini conjectured that for any fixed C, the
probability the random walk covers G in Cn steps is exponentially small.
In joint work with Jeff Kahn, we confirm this conjecture. Involved in
the proof is a similar statement for Markov chains in which all
transition probabilities are sufficiently small relative to C.​</span><br></p> | 10/21/2021 5:00:00 PM | 10/21/2021 6:00:00 PM | | |
| Bryan Shader, University of Wyoming | 219 | Bryan Shader, University of Wyoming | | | 10/28/2021 5:00:00 PM | 10/28/2021 6:00:00 PM | | |
| Gabriela Araujo, Universidad Nacional Autónoma de México | 217 | Gabriela Araujo, Universidad Nacional Autónoma de México | | | 11/4/2021 5:00:00 PM | 11/4/2021 6:00:00 PM | | |
| Li-An Chen, University of Delaware | 220 | Li-An Chen, University of Delaware | | | 11/11/2021 6:00:00 PM | 11/11/2021 7:00:00 PM | | |
This Page Last Modified On:
<a target='_blank' href='/Lists/CalendarDiscreteMathematics/calendar.aspx' class='ms-promotedActionButton'> <span style='font-size:16px;margin-right:5px;position:relative;top:2px;' class='fa fa-pencil-square-o'></span><span class='ms-promotedActionButton-text'>EDIT CALENDAR</span> </a>
