Abstract
We investigate the effective resistance Rn and conductance Cn between the root and leaves of a binary tree of height n. In this electrical network, the resistance of each edge e at distance d from the root is defined by re=2dXe where the Xe are i.i.d. positive random variables bounded away from zero and infinity. It is shown that ERn=nEXe−(Var (Xe)/EXe)ln n+O(1) and Var (Rn)=O(1). Moreover, we establish sub-Gaussian tail bounds for Rn. We also discuss some possible extensions to supercritical Galton–Watson trees.
Citation
Louigi Addario-Berry. Nicolas Broutin. Gábor Lugosi. "Effective resistance of random trees." Ann. Appl. Probab. 19 (3) 1092 - 1107, June 2009. https://doi.org/10.1214/08-AAP572
Information