arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2405.17847q-bio.PEcs.DMmath.COmath.PR
收藏

k-正则树系统发育协方差矩阵的稀疏化

Sparsification of Phylogenetic Covariance Matrices of $k$-Regular Trees

Department of Applied Mathematics, University of Colorado, Boulder(科罗拉多大学博尔德分校应用数学系)

Sean P. Svihla, Manuel E. Lladser

AI总结:

本文将随机二叉树协方差矩阵的Haar-like小波稀疏化结果推广到任意k≥2的k-正则树,通过改进内部路径长度均值和方差的渐近公式实现。

摘要:

考虑一棵树 $T=(V,E)$,其根为 $\circ$,边长函数为 $\ell:E\to\mathbb{R}_+$。$T$ 的系统发育协方差矩阵是矩阵 $C$,其行和列由 $L$($T$ 的叶集)索引,对于每个 $i,j\in L$,元素为 $C(i,j):=\sum_{e\in[i\wedge j,o]}\ell(e)$。最近的工作 [15] 表明,一棵大型随机二叉树 $T$ 的系统发育协方差矩阵在关于 $T$ 的所谓 Haar-like 小波进行基变换后,以压倒性高概率被显著稀疏化。这一发现显著地使得无需将大型二叉树的协方差矩阵存储在计算机内存中即可操作其谱,而只需对树进行两次后序遍历。在 [15] 的方法基础上,本手稿进一步推进了其稀疏化结果,使其涵盖更广泛的 $k$-正则树类别,对任意给定的 $k\ge2$ 均成立。这一扩展是通过利用超几何函数的性质和恒等式,改进随机 $k$-正则树内部路径长度的均值和方差的现有渐近公式来实现的。

英文摘要:

Consider a tree $T=(V,E)$ with root $\circ$ and edge length function $\ell:E\to\mathbb{R}_+$. The phylogenetic covariance matrix of $T$ is the matrix $C$ with rows and columns indexed by $L$, the leaf set of $T$, with entries $C(i,j):=\sum_{e\in[i\wedge j,o]}\ell(e)$, for each $i,j\in L$. Recent work [15] has shown that the phylogenetic covariance matrix of a large, random binary tree $T$ is significantly sparsified with overwhelmingly high probability under a change-of-basis with respect to the so-called Haar-like wavelets of $T$. This finding notably enables manipulating the spectrum of covariance matrices of large binary trees without the necessity to store them in computer memory but instead performing two post-order traversals of the tree. Building on the methods of [15], this manuscript further advances their sparsification result to encompass the broader class of $k$-regular trees, for any given $k\ge2$. This extension is achieved by refining existing asymptotic formulas for the mean and variance of the internal path length of random $k$-regular trees, utilizing hypergeometric function properties and identities.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑