 |
Universität Augsburg
|
|
|
Universität Augsburg
|
|
Professor Dr. Pieter Trapman
Groningen
spricht am
Mittwoch, 21. Oktober 2026
um
17:00 Uhr
im
Raum 2004 (L1)
über das Thema:
| Abstract: |
| We study the consensus time for the voter-model on the largest component of G(n,p), the Erdős–Rényi random graph, in the large n limit. We do this through studying T, the asymptotic meeting time of two independent stationary random walks on (realisations of) supercritical, slightly-supercritical and critical Erdős–Rényi graphs. We show that in the slightly-supercritical and supercritical case E[T]/n is with high probability bounded below and above by positive constants, which are independent of p (where with high probability refers to the realisation of the random graph). In the critical case E[T] is of order n in probability. This result might be unexpected, because the number of vertices in the largest components in the critical and slightly-supercritical case are o(n). This talk is based on joint work with Slavik Koval (Groningen) and Yuval Peres (Beijing) with a preprint at arXiv:2607.13183 |
| Hierzu ergeht herzliche Einladung. |
| Prof. Dr. Markus Heydenreich |