Modeling random walkers on growing random networks

Abstract

We present continuum models that describe the evolution of the position of a random walker on a growing network using four different growth algorithms. Three of these involve a random element, including one in which the motility rate of the random walker controls the network topology. For motility rates in which the position of the walker can be treated as quasi-stationary, we present accurate approximations to replace pair probabilities that allow us to numerically solve an otherwise intractable system of equations.

References in corpus (7)

• Temporal Networks
• Random walks and search in time-varying networks
• Scale-Free Networks Generated By Random Walkers
• Dynamical Systems on Networks: A Tutorial
• Scale Free Networks from Self-Organisation
• A random walker's view of networks whose growth it shapes
• Compressibility of random walker trajectories on growing networks

Cited by in corpus (1)

• Compressibility of random walker trajectories on growing networks