Article contents
The degree-wise effect of a second step for a random walk on a graph
Published online by Cambridge University Press: 16 January 2019
Abstract
In this paper we consider the degree-wise effect of a second step for a random walk on a graph. We prove that under the configuration model, for any fixed degree sequence the probability of exceeding a given degree threshold is smaller after two steps than after one. This builds on recent work of Kramer et al. (2016) regarding the friendship paradox under random walks.
- Type
- Research Papers
- Information
- Copyright
- Copyright © Applied Probability Trust 2018
References
- 1
- Cited by