Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A box-covering algorithm for fractal scaling in scale-free networks   A random sequential box-covering algorithm recently introduced to measure the
fractal dimension in scale-free networks is investigated. The algorithm
contains Monte Carlo sequential steps of choosing the position of the center of
each box, and thereby, vertices in preassigned boxes can divide subsequent
boxes into more than one pieces, but divided boxes are counted once. We find
that such box-split allowance in the algorithm is a crucial ingredient
necessary to obtain the fractal scaling for fractal networks; however, it is
inessential for regular lattice and conventional fractal objects embedded in
the Euclidean space. Next the algorithm is viewed from the cluster-growing
perspective that boxes are allowed to overlap and thereby, vertices can belong
to more than one box. Then, the number of distinct boxes a vertex belongs to is
distributed in a heterogeneous manner for SF fractal networks, while it is of
Poisson-type for the conventional fractal objects.

29
The categories of this paper are: funct-an
20
The categories of this paper are: acc-phys
24
The categories of this paper are: dg-ga
0
The categories of this paper are: hep-ph
31
The categories of this paper are: ao-sci
22
The categories of this paper are: chao-dyn
30
The categories of this paper are: q-alg
15
The categories of this paper are: nucl-ex
6
The categories of this paper are: astro-ph
9
The categories of this paper are: nlin
14
The categories of this paper are: math-ph
8
The categories of this paper are: hep-ex
17
The categories of this paper are: q-fin
32
The categories of this paper are: atom-ph
19
The categories of this paper are: eess
37
The categories of this paper are: supr-con