On hyperbolic graphs induced by iterated function systems (Q529228): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.aim.2017.04.012 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1016/J.AIM.2017.04.012 / rank
 
Normal rank

Latest revision as of 20:35, 9 December 2024

scientific article
Language Label Description Also known as
English
On hyperbolic graphs induced by iterated function systems
scientific article

    Statements

    On hyperbolic graphs induced by iterated function systems (English)
    0 references
    0 references
    0 references
    18 May 2017
    0 references
    Starting with a contractive iterated function system (IFS) \(\{S_j\}_{j=1}^N\) on \(\mathbb{R}^d\), the authors define an augmented tree \((X,\mathcal{E})\) associated with \(X\) and show that it is hyperbolic in the sense of Gromov. Further, they prove that the hyperbolic boundary of the augmented tree is Hölder equivalent to the attractor of the IFS, and that \((X,\mathcal{E})\) is of bounded degree iff \(\{S_j\}_{j=1}^N\) satisfies the open set condition. In addition, applications to random walks on graphs and the Lipschitz equivalence of self-similar sets are discussed.
    0 references
    hyperbolic graph
    0 references
    hyperbolic boundary
    0 references
    iterated function system
    0 references
    self-similar set
    0 references
    open set condition
    0 references
    weak separation condition
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers