The fractal property is one of the most important properties in complex networks. It describes
the power law relationship between characteristics of the box and the box size. There are …

Box-covering algorithm is a widely used method to measure the fractal dimension of
complex networks. Existing researches mainly deal with the fractal dimension of unweighted …

Covering a network with the minimum possible number of boxes can reveal interesting
features for the network structure, especially in terms of self-similar or fractal characteristics …

A random sequential box-covering algorithm recently introduced to measure the fractal
dimension in scale-free (SF) networks is investigated. The algorithm contains Monte Carlo …

Hierarchical networks as fundamental models to describe the complex networks, have many
applications in networks science, engineering technology and so on. In this paper, we first …

Fractal scaling and self-similar connectivity behaviour of scale-free (SF) networks are
reviewed and investigated in diverse aspects. We first recall an algorithm of box-covering …

Fractal scaling—a power-law behavior of the number of boxes needed to tile a given
network with respect to the lateral size of the box—is studied. We introduce a box-covering …

We find that the fractal scaling in a class of scale-free networks originates from the
underlying tree structure called a skeleton, a special type of spanning tree based on the …

In the field of complex networks, how to identify influential nodes is a significant issue in
analyzing the structure of a network. In the existing method proposed to identify influential …

We study the betweenness centrality of fractal and nonfractal scale-free network models as
well as real networks. We show that the correlation between degree and betweenness …