Routeing on trees
Number of Authors: 2
2016 (English)In: Journal of Applied Probability, ISSN 0021-9002, E-ISSN 1475-6072, Vol. 53, no 2, 475-488 p.Article in journal (Refereed) Published
We consider three different schemes for signal routeing on a tree. The vertices of the tree represent transceivers that can transmit and receive signals, and are equipped with independent and identically distributed weights representing the strength of the transceivers. The edges of the tree are also equipped with independent and identically distributed weights, representing the costs for passing the edges. For each one of our schemes, we derive sharp conditions on the distributions of the vertex weights and the edge weights that determine when the root can transmit a signal over arbitrarily large distances.
Place, publisher, year, edition, pages
2016. Vol. 53, no 2, 475-488 p.
Trees, transmission, first passage percolation, branching random walk, Markov chain
IdentifiersURN: urn:nbn:se:su:diva-132488DOI: 10.1017/jpr.2016.14ISI: 000378598700013OAI: oai:DiVA.org:su-132488DiVA: diva2:953235