Strongly reinforced Pólya urns with graph-based competition

Remco van der Hofstad, Mark Holmes, Alexey Kuznetsov +1

We introduce a class of reinforcement models where, at each time step $t$, one first chooses a random subset $A_t$ of colours (independent of the past) from $n$ colours of balls, a…