https://hal.inria.fr/hal-02411250Iacobelli, GiulioGiulioIacobelliIM / UFRJ - Instituto de Matemática da Universidade Federal do Rio de Janeiro - UFRJ - Universidade Federal do Rio de JaneiroFigueiredo, DanielDanielFigueiredoCOPPE-UFRJ - Instituto Alberto Luiz Coimbra de Pós-Graduação e Pesquisa de Engenharia - UFRJ - Universidade Federal do Rio de JaneiroNeglia, GiovanniGiovanniNegliaNEO - Network Engineering and Operations - CRISAM - Inria Sophia Antipolis - Méditerranée - Inria - Institut National de Recherche en Informatique et en AutomatiqueTransient and slim versus recurrent and fat: Random walks and the trees they growHAL CCSD2019[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM][INFO.INFO-SI] Computer Science [cs]/Social and Information Networks [cs.SI]Neglia, Giovanni2019-12-14 16:41:332023-03-15 08:58:092019-12-16 09:30:45enJournal articleshttps://hal.inria.fr/hal-02411250/document10.1017/jpr.2019.43application/pdf1Network 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.