We introduce a new class of balanced allocation processes which bias tow...
We show that for any natural number s, there is a constant γ and a
subgr...
We generalise the popular cops and robbers game to multi-layer graphs, w...
We consider the allocation of m balls (jobs) into n bins (servers). In
t...
We study random walks on the giant component of Hyperbolic Random Graphs...
It is well known that if m balls (jobs) are placed sequentially into n
b...
Twin-width is a graph width parameter recently introduced by Bonnet, Kim...
The NP-complete graph problem Cluster Editing seeks to transform a stati...
We consider the sequential allocation of m balls (jobs) into n bins
(ser...
We introduce the random graph 𝒫(n,q) which results from taking
the union...
The cover time of a Markov chain on a finite state space is the expected...
Random walks on graphs are an essential primitive for many randomised
al...
We study the biased random walk where at each step of a random walk a
"c...
We apply the power-of-two-choices paradigm to random walk on a graph: ra...
We study two random processes on an n-vertex graph inspired by the inter...