الصفحة 1
الصفحة 1
Measure, Topology, and Fractal Geometry
For the Second Edition of this highly regarded textbook, Gerald Edgar has made numerous additions and changes, in an attempt to provide a clearer and more focused exposition. The most important addition is an increased emphasis on the packing measure, so that now it is often treated on a par with the Hausdorff measure. The topological dimensions were rearranged for Chapter 3, so that the covering dimension is the major one, and the inductive dimensions are the variants. A "reduced cover class" notion was introduced to help in proofs for Method I or Method II measures. Research results since 1990 that affect these elementary topics have been taken into account. Some examples have been added, including Barnsley leaf and Julia set, and most of the figures have been re-drawn.
Fractal Dimensions of Networks
The goal of the book is to provide a unified treatment of fractal dimensions of sets and networks. Since almost all of the major concepts in fractal dimensions originated in the study of sets, the book achieves this goal by first clearly presenting, with an abundance of examples and illustrations, the theory and algorithms for sets, and then showing how the theory and algorithms have been applied to networks. For example, the book presents the classical theory and algorithms for the box counting dimension for sets, and then presents the box counting dimension for networks. All the major fractal dimensions are studied, e.g., the correlation dimension, the information dimension, the Hausdorff dimension, the multifractal spectrum, as well as many lesser known dimensions. Algorithm descriptions are accompanied by worked examples, with many applications of the methods presented.
