arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1011.3971math.PR
收藏

在一棵没有身份证的彩色树上。随机标号

On a coloured tree with non i.i.d. random labels

Skevi Michael, Stanislav Volkov

摘要:

我们得到了Menshikov et al(2007)和Volkov(2006)中引入的概率模型的新结果,该模型涉及$d$ -ary正则树。所有顶点都以$d$不同的颜色之一着色,以便每个顶点的$d$子节点都具有不同的颜色。修复$d^2$严格正随机变量。对于树的任何两个连接的顶点,为它们之间的边分配{ \it标签},该标签具有与这些随机变量之一相同的分布,使得分布仅由其端点的颜色确定。顶点的{ \it A value}被定义为连接顶点到根的路径上的所有标签的乘积。我们研究了$x$值以上的顶点总数如何随着$x\downarrow 0$的增长而增长,并将结果应用到其他一些相关的模型中。

英文摘要:

We obtain new results for the probabilistic model introduced in Menshikov et al (2007) and Volkov (2006) which involves a $d$-ary regular tree. All vertices are coloured in one of $d$ distinct colours so that $d$ children of each vertex all have different colours. Fix $d^2$ strictly positive random variables. For any two connected vertices of the tree assign to the edge between them {\it a label} which has the same distribution as one of these random variables, such that the distribution is determined solely by the colours of its endpoints. {\it A value} of a vertex is defined as a product of all labels on the path connecting the vertex to the root. We study how the total number of vertices with value of at least $x$ grows as $x\downarrow 0$, and apply the results to some other relevant models.

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

↑