生长随机树的寻根算法和Jordan中心性的持久性
Root finding algorithms and persistence of Jordan centrality in growing random trees
摘要:
我们考虑模型的增长随机树$\{\mathcal{T}_f(n):n\geq 1\}$与模型动力学驱动的附件功能$f:\mathbb{Z}_+\to \mathbb{R}_+$。在每个阶段,一个新的顶点进入系统,并以与$f(\text{degree}(v))$成比例的概率连接到当前树中的顶点$v$。本研究的主要目的是了解寻根算法的性能。在过去的几年里,出现了大量的工作(例如Bubeck,Devroye和Lugosi或Jog和Loh的工作),使用基于Jordan中心性度量及其变体的技术来开发根查找算法。给定一个无标签的无根树,计算树中每个顶点的Jordan中心性,对于固定的预算,$K$输出最佳$K$顶点(由Jordan中心性测量)。在一般条件下的附件功能$f$,我们推导出必要的和充分的预算上的界限$K(ε)$,以恢复根的概率至少$1-ε$。对于典型的例子,如线性偏好连接和均匀连接,这些一般的结果给出了匹配的上界和下界的预算。我们还证明了持久性的最佳$K$约旦中心的任何$K$,即存在一个几乎肯定有限的随机时间$n^*$,使$n \geq n^*$的身份的$K$ -最佳约旦中心$\{\mathcal{T}_f(n):n\geq n^*\}$不会改变,从而描述了这种措施的鲁棒性。在独立利益的证明中的关键技术成分包括指数矩的存在的充分条件(适当规范化)连续时间分支过程的限制,其中模型$\{\mathcal{T}_f(n):n\geq n^*\}$可以嵌入,以及收敛速度的结果,这些限制。
英文摘要:
We consider models of growing random trees $\{\mathcal{T}_f(n):n\geq 1\}$ with model dynamics driven by an attachment function $f:\mathbb{Z}_+\to \mathbb{R}_+$. At each stage a new vertex enters the system and connects to a vertex $v$ in the current tree with probability proportional to $f(\text{degree}(v))$. The main goal of this study is to understand the performance of root finding algorithms. A large body of work (e.g. the work of Bubeck, Devroye and Lugosi or Jog and Loh) has emerged in the last few years in using techniques based on the Jordan centrality measure and its variants to develop root finding algorithms. Given an unlabelled unrooted tree, one computes the Jordan centrality for each vertex in the tree and for a fixed budget $K$ outputs the optimal $K$ vertices (as measured by Jordan centrality). Under general conditions on the attachment function $f$, we derive necessary and sufficient bounds on the budget $K(ε)$ in order to recover the root with probability at least $1-ε$. For canonical examples such as linear preferential attachment and uniform attachment, these general results give matching upper and lower bounds for the budget. We also prove persistence of the optimal $K$ Jordan centers for any $K$, i.e. the existence of an almost surely finite random time $n^*$ such that for $n \geq n^*$ the identity of the $K$-optimal Jordan centers in $\{\mathcal{T}_f(n):n\geq n^*\}$ does not change, thus describing robustness properties of this measure. Key technical ingredients in the proofs of independent interest include sufficient conditions for the existence of exponential moments for limits of (appropriately normalized) continuous time branching processes within which the models $\{\mathcal{T}_f(n):n\geq n^*\}$ can be embedded, as well as rates of convergence results to these limits.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。