首页> 外文期刊>Sankhya >A Necessary and Sufficient Condition for the Tail-Triviality of a Recursive Tree Process
【24h】

A Necessary and Sufficient Condition for the Tail-Triviality of a Recursive Tree Process

机译:递归树过程的尾部平凡性的充要条件

获取原文
获取原文并翻译 | 示例
           

摘要

Given a recursive distributional equation (RDE) and a solution μ of it, we consider the tree indexed invariant process called the recursive tree process (RTP) with marginal μ. We introduce a new type of bivariate uniqueness property which is different from the one defined by Aldous and Bandyopadhyay (2005), and we prove that this property is equivalent to tail-triviality for the RTP, thus obtaining a necessary and sufficient condition to determine tail-triviality for a RTP in general. As an application we consider Aldous' construction of the frozen percolation process on a infinite regular tree (Aldous, 2000) and show that the associated RTP has a trivial tail.
机译:给定一个递归分布方程(RDE)及其解μ,我们考虑具有边际μ的树索引不变过程称为递归树过程(RTP)。我们引入了一种新的双变量唯一性属性,该属性不同于Aldous和Bandyopadhyay(2005)定义的属性,我们证明了该属性等效于RTP的尾部平凡性,从而获得了确定尾部的充要条件。 RTP的一般性。作为应用,我们考虑了Aldous在无限规则树上构造冻结渗透过程的方法(Aldous,2000年),并表明相关的RTP具有琐碎的尾巴。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号