17 citations · 17 across the 3 of their papers we have counts for
3 papers
math.PR2026
Peripheral Traps and Lower Bounds on Mixing Times for Random Walks on Sparse Heavy-Tailed Random Intersection Graphs
Vyacheslav Koval
This paper analyzes mixing time lower bounds for random walks on sparse, heavy-tailed Random Intersection Graphs. In sparse feature regimes, heavy-tailed feature distributions lead…
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
We prove that the stationary and worst-case expected meeting times of two independent continuous-time random walks on the largest component of the Erdős-Rényi random graph …
math.PR2010★ 17 cited
Long-range percolation on the hierarchical lattice
Vyacheslav Koval, Ronald Meester, Pieter Trapman
We study long-range percolation on the hierarchical lattice of order , where any edge of length is present with probability , independently of all oth…