Multifractal decompositions of digraph recursive fractals

We prove that the multifractal decomposition behaves as expected for a family of sets K known as digraph recursive fractals, using measures μ of Markov type. For each value of a parameter α between a minimum α min and maximum α max , we define «multifractal components» K (α) of K, and show that they are fractals in the sense of Taylor. The dimension f(α) of K (α) is computed from the data of the problem. The typical concave «multifractal f(α)» dimension spectrum curve results