15 citations · 24 across the 3 of their papers we have counts for
3 papers
math.PR2008★ 9 cited
Ballot theorems for random walks with finite variance
L. Addario-Berry, B. A. Reed
We prove an analogue of the classical ballot theorem that holds for any random walk in the range of attraction of the normal distribution. Our result is best possible: we exhibit e…
math.CO2007★ 15 cited
The Evolution of the Mixing Rate
Nikolaos Fountoulakis, Bruce Reed
In this paper we present a study of the mixing time of a random walk on the largest component of a supercritical random graph, also known as the giant component. We identify local…
math.CO2003
List colouring of graphs with at most vertices
Bruce Reed, Benny Sudakov
Ohba has conjectured \cite{ohb} that if the graph has or fewer vertices then the list chromatic number and chromatic number of are equal. In this paper we prove t…