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. © Applied Probability Trust 2018.
| Original language | English |
|---|---|
| Pages (from-to) | 1203-1210 |
| Journal | Journal of Applied Probability |
| Volume | 55 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 1 Dec 2018 |
| Externally published | Yes |
Bibliographical note
Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].Research Keywords
- configuration model
- Friendship paradox
- graph
- random walk
Fingerprint
Dive into the research topics of 'The degree-wise effect of a second step for a random walk on a graph'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver