Lifting linear preferential attachment trees yields the arcsine coalescent

preprint2016arXivOpen access

Abstract

We consider linear preferential attachment trees which are specific scale-free trees also known as (random) plane-oriented recursive trees. Starting with a linear preferential attachment tree of size nn 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 {1,…,n}\{1, \ldots, n\} by placing labels in the same block if and only if they are attached to the same node in the tree. Our main result is that this Markov chain on linear preferential attachment trees induces a partition valued process which is equal in distribution (up to a random time-change) to the arcsine nn-coalescent, that is the multiple merger coalescent whose ΛΛ measure is the arcsine distribution.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.