We consider linear preferential attachment trees which are specific scale-free trees also known as Albert-Barabási trees or random plane-oriented recursive trees. Starting with a linear preferential attachment tree of size n we show that repeatedly applying a so-called lifting yields a continuous-time Markov chain on linear preferential attachment trees. Each such tree induces a partition of...