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

DOI10.1016/J.SPL.2010.08.017zbMATH Open1217.60088arXiv1011.3971OpenAlexW2019492353MaRDI QIDQ613181FDOQ613181

Authors: Skevi Michael, Stanislav Volkov 

Publication date: 20 December 2010

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Abstract: 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 $xdownarrow0$, and apply the results to some other relevant models.

Full work available at URL: https://arxiv.org/abs/1011.3971

Recommendations

• Random environment on coloured trees
• scientific article; zbMATH DE number 4053643
• The continuum random tree. I
• On the probability of occurence of labelled subtrees of a randomly labelled tree
• A family of random trees with random edge lengths

zbMATH Keywords

first-passage percolationbranching random walksrandom environment on trees

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Processes in random environments (60K37)

Cites Work

• Large deviations
• Convergence results on multitype, multivariate branching random walks
• Random environment on coloured trees
• A probabilistic model for the 5\(x\)+1 problem and related maps

Cited In (4)

• Title not available (Why is that?)
• Uniqueness of uniform random colorings of regular trees
• On coincidences of tuples in a binary tree with random labels of vertices
• Random environment on coloured trees

This page was built for publication: On a coloured tree with non i.i.d. random labels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q613181)