Retraction Note: Modified box dimension and average weighted receiving time on the weighted fractal networks

This paper has been retracted.

Scientific RepoRts | 5:18210 | DOI: 10.1038/srep18210 receiving time (AWRT) is the sum of mean weighted first-passage times (MFPTs) for all nodes absorpt at the trap located at a given target node [16][17][18] . In 2013, Dai et al. introduced the non-homogenous weighted Koch networks depending on the three weight factors 19 . They defined the average weighted receiving time (AWRT) for the first time and studied the AWRT on random walk. Recently, fractals have also attracted an increasing attention in physics and other scientific fields, owning to the striking beauty intrinsic in their structures and the significant impact of the idea of fractals. These structures have been a focus of research objects and many underlying properties have been found. So it makes sense to combining weighted networks with fractals which are called weighted fractal networks. Daudert and Lapidus 20 studied weighted graphs and random walks on the Koch snowflake. Carletti and Righi 21 defined a class of weighted complex networks whose topology can be completely analytically characterized in terms of the involved parameters and of the fractal dimension.
This paper is organized as follow. Based on weighted fractal networks 21 , we introduce a family of the weighted fractal networks depending on the number of copies s and the weight factor r in the next section. In Section 3, the definition of modified box dimension and a rigorous proof for its existence are given in the case of the weighted fractal networks. In Section 4, the average weighted receiving time (AWRT) on random walk is obtained by recursive formulas for ( ) F n 1 and ( ) T n tot . When the weight factor is larger than the number of copies, we show that the efficiency of the trapping process depends on the modified box dimension: the larger the value of modified box dimension, the more efficient the trapping process is. In the last section we draw conclusions.

Weighted fractal networks
In this section a family of weighted fractal networks are introduced.
Let ( > ) r r 1 be a positive real numbers, and ( > ) s s 1 be a positive integer.
(1) Let G 1 be our base graph, composed by + N 1 nodes Σ = , , , all other nodes except for the attaching node, satisfying the symmetry of nodes in G 1 . The edge set of G 1 is denoted by ( ) E G 1 . If the pair , ∈ Σ x y 1 1 1 is connected by an edge, then this edge is denoted by ( , ) x y 1 1 . Each of ( , ), ( , ), ,( , ), in G 1 means that the network G 1 is invariable no matter how two arbitrary nodes i and j are exchanged ( , ∈ , , } . (2) For any ≥ n 1, G n is obtained from − G n 1 (see Fig. 1): G n has one attaching node labelled by  . If the pair , ∈ Σ x y n is connected by an edge, then this edge is denoted by ( , ) x y . Let ( ) E G n be the set of edges in G n . For = , , The weighted fractal networks are set up. According to the construction of the weighted fractal networks, one can see that G n , the weighted fractal networks of n-th generation, is characterized by three parameters n, s and r: n being the number of generations, s being the number of copies, and r representing the weight factor. The total number of nodes in G n is as follows.

Modified box dimension
Definition 3.1. The weighted shortest path of nodes i and j in the weighted graphs G n is given by where Γ is the set of paths linking i and j in G n 21 . The self-similar property of real-world networks, box-counting method turns to be practical 22 and B k n denotes the minimal number of boxes of size l k that we need to cover G n . Theorem 3.3. For the weighted fractal networks the modified box dimension: where s is the number of copies, r is the weighted factor. For convenience of description, we recall the following notations.
We fix an arbitrary self-map p of Σ 1 such that for = , , , Proof. We will prove this from two respects.
(1) Considering the worst case scenario, i.e., choosing = ( , yields that (2) We construct a path , ( ) P x y between two arbitrary nodes x and y that is no longer than Starting from x the first half of the path , ( ) x y P is as follows: Starting from y the first half of the path , ( ) p x y is as follows.  Proof. It is easy to see that we need one l 1 -box to cover G 1 . It follows from the weighted structure of G n that G n contains − s n 1 copies of G 1 and nodes. This implies that we can cover G n with + ( 1 two arbitrary nodes in − + G n k 1 contained by the same l 1 -box, i.e., the distance between x and y is not greater than ( ) G diam 1 . If we blow them up, we get two cylinder sets of nodes: and ∧ = − x y n k. Namely that  1 steps on any path between ∈ Z z x x and ∈ Z z y y . These witness must be in distinct l 1 boxes, so we need at least − s n 1 l 1 -boxes to cover G n . # Lemma 3.8. The following inequality holds Proof. We have constructed − s i 1 nodes in G i whose pairwise distance is greater than ( ) G diam 1 . It is enough to show that we can find the same number of nodes (i.e., − s i 1 ) in + G i j , ≥ j 1 such that the pairwise distances between them are greater than (

Upper bound of modified box dimension
where the cylinder set of nodes = ( ) ∈ Σ |( )= .
Now we give a lower bound on the shortest path between z x and z y where , ∈ Σ x y i . We need at least ( steps on any path between z x and z y . Hence these witness must be in distinct l j boxes. So we need at least − s i 1 l j -boxes to cover + G i j . i.e., substitutily = + n i j and = k j yields that Assuming that the walker, at each step, starting from its current node, moves uniformly to any of its nearest neighbors. For two adjacency nodes i and j, the weighted time is defined as the corresponding edge weight w ij . The mean weighted first-passing time (MWFPT) is the expected first arriving weighted time for the walks starting from a source node to a given target node. Let ( ) F n ij be the mean weighted first-passage time (MWFPT) for a walker starting from Node i to Node j. Let ( ) F n i be the MWFPT from Node i to the trap. T n is the average weighted receiving time (AWRT), which is defined as the average of ( ) F n i over all starting nodes other than the trap. T n is the key question concerned in this paper. Theorem 4.1. For a large system, i.e., → ∞ N n , (1) if > r s, we have the following expression for the dominating term of T n : Remark. This confirms that in the large n limit, if > r s then the AWRT grows as a power law function of the network order with the exponent, represented by θ = { } n n N grows from 0 to 1, the exponent decreases from +∞ approaches 1. This also means that the efficiency of the trapping process depends on the modified box dimension: the larger the value of modified box dimension, the more efficient the trapping process is.
Proof. By definition, T n is given by Thus, the problem of determining T n is reduced to finding ( ) T n tot . We will compute ( ) T n tot by segmenting G n . From the self-similarity construction method of ( ≥ ) G n 2 n , G n can be regarded as merging + s 1 groups, sequentially denoted by , , . In order to completely explain the division of the general weighted fractal networks, we present the special division of the 'Sierpinski' weighted fractal networks when = s 3 (see Fig. 2). Through this division, we can rewrite the sum ( ) T g tot as follows:   . Figure 2. Take the 'Sierpinski' weighted fractal networks G n , for example, G 2 is regarded as merging ( ) Scientific RepoRts | 5:18210 | DOI: 10.1038/srep18210 Thus, the problem of determining ( ) T n tot is reduced to finding ( ) F n 1 . Note that the strength of Node ( = , , , )  i i s 1 2 is + s 1 according to the construction of G n . Using the division of G n , we have In the given initial network G 1 , let F i be the the mean weighted first-passage times (MWFPTs) for a walker from Node i in (1) If > r s, the dominating term of T n is written as follows: