Transient and slim versus recurrent and fat: Random walks and the trees they grow - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Applied Probability Year : 2019

Transient and slim versus recurrent and fat: Random walks and the trees they grow


Network growth models that embody principles such as preferential attachment and local attachment rules have received much attention over the last decade. Among various approaches, random walks have been leveraged to capture such principles. In this paper we consider the No Restart Random Walk (NRRW) model where a walker builds its graph (tree) while moving around. In particular, the walker takes s steps (a parameter) on the current graph. A new node with degree one is added to the graph and connected to the node currently occupied by the walker. The walker then resumes, taking another s steps, and the process repeats. We analyze this process from the perspective of the walker and the network, showing a fundamental dichotomy between transience and recurrence for the walker as well as power law and exponential degree distribution for the network. More precisely, we prove the following results: s = 1: the random walk is transient and the degree of every node is bounded from above by a geometric distribution. s even: the random walk is recurrent and the degree of non-leaf nodes is bounded from below by a power law distribution with exponent decreasing in s. We also provide a lower bound for the fraction of leaves in the graph, and for s = 2 our bound implies that the fraction of leaves goes to one as the graph size goes to infinity. NRRW exhibits an interesting mutual dependency between graph building and random walking that is fundamentally influenced by the parity of s. Understanding this kind of coupled dynamics is an important step towards modeling more realistic network growth processes.
Fichier principal
Vignette du fichier
1711.02913.pdf (3.59 Mo) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-02411250 , version 1 (14-12-2019)



Giulio Iacobelli, Daniel Figueiredo, Giovanni Neglia. Transient and slim versus recurrent and fat: Random walks and the trees they grow. Journal of Applied Probability, 2019, 56 (03), pp.769-786. ⟨10.1017/jpr.2019.43⟩. ⟨hal-02411250⟩
39 View
113 Download



Gmail Mastodon Facebook X LinkedIn More