Lipschitz equivalence of graph-directed fractals
This paper studies the geometric structure of graph-directed sets from the point of view of Lipschitz equivalence. It is proved that if and are dust-like graph-directed sets satisfying the transitivity condition, then and are Lipschitz equivalent, and and are quasi-Lipschitz equivalent when they have the same Hausdorff dimension.