随机树的两个独立副本共享的诱导子树的期望数
Expected number of induced subtrees shared by two independent copies of a random tree
摘要:
考虑一棵根树$T$,其叶集为$[n]$,并且所有非叶顶点至少具有出度$2$。如果$\mathcal T$是$S$的最低共同祖先子树,且其所有2度顶点被抑制,则根树$\mathcal T$具有叶集$S\subset [n]$由$T$中的$S$诱导。一对两棵树$T'$和$T"$的“最大一致性子树”(MAST)是具有最大叶集$S\subset [n]$的树$\mathcal T$,使得$\mathcal T$在$T'$和$T"$两者中由$S$诱导。Bryant等人的\cite{BryMcKSte}和Bernstein等人的\cite{Ber}证明了,除其他结果外,对于$T'$和$T"$是随机二进制(均匀或Yule-Harding分布)树$T$的两个独立副本,$\text{MAST}(T',T")$的可能数量级是$O(n^{1/2})$。我们证明了这一界广泛的一类随机根树:$T$是一个终端树的分支,高尔顿-沃森,过程的有序后代分布的平均$1$,条件是“叶的总数是$n$“。
英文摘要:
Consider a rooted tree $T$ with leaf-set $[n]$, and with all non-leaf vertices having out-degree $2$, at least. A rooted tree $\mathcal T$ with leaf-set $S\subset [n]$ is induced by $S$ in $T$ if $\mathcal T$ is the lowest common ancestor subtree for $S$, with all its degree-2 vertices suppressed. A "maximum agreement subtree" (MAST) for a pair of two trees $T'$ and $T"$ is a tree $\mathcal T$ with a largest leaf-set $S\subset [n]$ such that $\mathcal T$ is induced by $S$ both in $T'$ and $T"$. Bryant et al. \cite{BryMcKSte} and Bernstein et al. \cite{Ber} proved, among other results, that for $T'$ and $T"$ being two independent copies of a random binary (uniform or Yule-Harding distributed) tree $T$, the likely magnitude order of $\text{MAST}(T',T")$ is $O(n^{1/2})$. We prove this bound for a wide class of random rooted trees : $T$ is a terminal tree of a branching, Galton--Watson, process with an ordered-offspring distribution of mean $1$, conditioned on "total number of leaves is $n$".
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。