On a coloured tree with non i.i.d. random labels
From MaRDI portal
Publication:613181
DOI10.1016/J.SPL.2010.08.017zbMATH Open1217.60088arXiv1011.3971OpenAlexW2019492353MaRDI QIDQ613181FDOQ613181
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 -ary regular tree. All vertices are coloured in one of distinct colours so that children of each vertex all have different colours. Fix 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 grows as , and apply the results to some other relevant models.
Full work available at URL: https://arxiv.org/abs/1011.3971
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
Cited In (3)
Recommendations
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)