Consider a vertex-reinforced jump process defined on a regular tree, where each vertex has exactly $b$ children, with $b geq 3$. We prove the strong law of large numbers and the central limit theorem for the distance of the process from the root. Notice that it is still unknown if vertex-reinforced jump process is transient on the binary tree.
展开▼
机译：考虑在规则树上定义的顶点增强的跳转过程，其中每个顶点正好具有$ b $个子级，其中$ b geq 3 $。我们证明了强大的大数定律和过程到根的距离的中心极限定理。注意，在二叉树上顶点增强的跳转过程是否是瞬态的仍然是未知的。
展开▼
