June 2016 Routeing on trees
Maria Deijfen, Nina Gantert
Author Affiliations +
J. Appl. Probab. 53(2): 475-488 (June 2016).

Abstract

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.

Citation

Download Citation

Maria Deijfen. Nina Gantert. "Routeing on trees." J. Appl. Probab. 53 (2) 475 - 488, June 2016.

Information

Published: June 2016
First available in Project Euclid: 17 June 2016

zbMATH: 1344.60082
MathSciNet: MR3514292

Subjects:
Primary: 60K37
Secondary: 60J10 , 60J80

Keywords: Branching random walk , first passage percolation , Markov chain , transmission , trees

Rights: Copyright © 2016 Applied Probability Trust

JOURNAL ARTICLE
14 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

Vol.53 • No. 2 • June 2016
Back to Top