Current interest in fractal dimensions of networks is the result of more than a century of previous research on dimensions. Fractal Dimensions of Networks  ties the theory and methods for computing fractal dimensions of networks to the "classic" theory of dimensions of geometric objects.

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. Thus, 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, many applications of the methods are presented, and many exercises, ranging in difficulty from easy to research level, are included.