Evolution of recursive trees with limited memory (2510.18856v1)

Abstract: Motivated by questions in social networks, distributed computing and probabilistic combinatorics, the last few years have seen increasing interest in network evolution models where new vertices entering the system need to make decisions based on a partial snapshot of the current state of the network. This paper considers a specific variant of the classical random recursive tree dynamics, where a vertex at time $n+1$ has information only on those vertices that have arrived in the interval $[j(n), n]$ for a sequence $j(n) \uparrow \infty$, and connects to vertices uniformly at random amongst this set. We consider two different regimes on the density information, termed macroscopic and mesoscopic regimes, which respectively correspond to $j(n)=\theta n$ for some $\theta \in (0,1)$, and $j(n)=n-n^{\beta}$ for some $\beta \in (0,1)$. Our main interest is in studying asymptotics of various local and global functionals of the network. We show that in the macroscopic regime, the local limit is expressed in terms of an associated continuous time branching process that depends on the parameter $\theta$, while it is a $\mathrm{Poisson}(1)$-branching process in the mesoscopic regime for any $\beta \in (0,1)$. Furthermore, the height of the macroscopic tree is logarithmic, which we prove exploiting a connection with scaled-attachment random recursive trees (SARRTs) as studied by Devroye, Fawzi and Fraiman (RSA 2011), while it is polynomial in the mesoscopic regime; our argument in this latter case relies on a differential equation approach to track the ancestor indices of late-coming vertices, together with a multiscale analysis. Further, we develop an exploration algorithm to simultaneously reveal the ancestral path of youngest vertices. Using this algorithm, we show that in the mesoscopic regime, the global structure experiences a phase transition at $\beta=1/2$.