Scaling limits for exploration algorithms

Paola Bermolen, Matthieu Jonckheere, Jaron Sanders

We consider an exploration algorithm where at each step, a random number of items become active while related items get explored. Given an initial number of items $N$ growing to in…