Multifractal decomposition of generalized digraph recursive sets with the finite intersection property (Q2732386)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Multifractal decomposition of generalized digraph recursive sets with the finite intersection property |
scientific article; zbMATH DE number 1623637
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Multifractal decomposition of generalized digraph recursive sets with the finite intersection property |
scientific article; zbMATH DE number 1623637 |
Statements
18 June 2002
0 references
multifractal decompositions
0 references
measures of Markov type
0 references
the finite intersection property
0 references
Multifractal decomposition of generalized digraph recursive sets with the finite intersection property (English)
0 references
In 1988, Mauldin and Williams gave the definition of a class of graph directed constructions and studied their Hausdorff dimension. In 1992, Edgar and Mauldin investigated their multifractal decompositions under the non-overlapping condition. In the present paper the author discusses the multifractal decompositions of graph directed constructions with the finite intersection property and gives their multifractal spectra.
0 references
0.845840334892273
0 references
0.8408820033073425
0 references
