Transient and slim versus recurrent and fat: Random walks and the trees they grow
Keyword(s):
AbstractThe no restart random walk (NRRW) is a random network growth model driven by a random walk that builds the graph while moving on it, adding and connecting a new leaf node to the current position of the walker every s steps. We show a fundamental dichotomy in NRRW with respect to the parity of s: for ${s}=1$ we prove that the random walk is transient and non-leaf nodes have degrees bounded above by an exponential distribution; for s even we prove that the random walk is recurrent and non-leaf nodes have degrees bounded below by a power law distribution. These theoretical findings highlight and confirm the diverse and rich behaviour of NRRW observed empirically.
2021 ◽
Vol 49
(1)
◽
pp. 79
Keyword(s):
Keyword(s):
2014 ◽
Vol 51
(4)
◽
pp. 1065-1080
◽
Keyword(s):
2007 ◽
Vol 39
(1)
◽
pp. 189-220
◽
Keyword(s):
Keyword(s):
2016 ◽
Vol 48
(A)
◽
pp. 99-118
◽
2019 ◽
Vol 9
(1)
◽
pp. 4246-4251
2014 ◽
Vol 51
(04)
◽
pp. 1065-1080
◽
Keyword(s):