STRUCTURE OF THE PATH LENGTH SET IN ASYMMETRIC TREES
Abstract
We characterize the path length set of asymmetric binary fractal trees in terms of the scaling ratios, r and ℓ. We show that if r + ℓ < 1, then the path length set is a Cantor set, and if r + ℓ ≥ 1, then the path length set is an interval.