From the 1 of 2 linked papers with an AI index.
2 papers
math.PR2026
Meeting and coalescence times for random walks in the largest component of the ErdÅs-Rényi random graph
Vyacheslav Koval, Yuval Peres, Pieter Trapman
The paper shows that the expected meeting time of two independent continuous-time random walks on the largest component of an Erdős–Rényi graph scales linearly with the number of v…
math.NT2026
Maximal Gaps for Dilated Lacunary Integer Sequences
Yuval Peres, Bohan Yang
Let \((a_n)_{n\ge1}\subset\mathbb{N}\) be a lacunary sequence, \(a_{n+1}\ge q a_n\) for \(q>1\). For \(x\in\mathbb{T}\), we study the maximal empty circular gap \(G_N(x)\) of the f…