High-Order Degree and Combined Degree in Complex Networks

Figure 1

Diagram of random walk. Choose the origin node 1: (a) the process of splitting and random walking could be repeated an infinite number of times, because origin node 1 is connected to node 2; (b) the ball can walk randomly an infinite number of times without split since the origin node is one of the directed loop; (c) the ball split and walk randomly only once; (d) the ball can only walk twice without splitting; (e) the ball can walk an infinite number of times without split.

(a)

(b)

(c)

(d)

(e)