Stochastic Systems and Control: Theory and ApplicationsView this Special Issue
Mean First Passage Time of Preferential Random Walks on Complex Networks with Applications
This paper investigates, both theoretically and numerically, preferential random walks (PRW) on weighted complex networks. By using two different analytical methods, two exact expressions are derived for the mean first passage time (MFPT) between two nodes. On one hand, the MFPT is got explicitly in terms of the eigenvalues and eigenvectors of a matrix associated with the transition matrix of PRW. On the other hand, the center-product-degree (CPD) is introduced as one measure of node strength and it plays a main role in determining the scaling of the MFPT for the PRW. Comparative studies are also performed on PRW and simple random walks (SRW). Numerical simulations of random walks on paradigmatic network models confirm analytical predictions and deepen discussions in different aspects. The work may provide a comprehensive approach for exploring random walks on complex networks, especially biased random walks, which may also help to better understand and tackle some practical problems such as search and routing on networks.
In the past two decades, as the effective modelling of a wide range of complex systems, complex networks have attracted much attention from both theorists and technologists . Most efforts were devoted to uncover the universal topological properties of real systems . Many empirical studies revealed that a large variety of real-world networks display simultaneously small-world phenomenon  and scale-free nature . These global properties imply a large connectivity heterogeneity. It is evidenced by power-law degree distributions and small average distance between nodes, together with strong clustering. But an even more intriguing task is to understand the interplay between the structure of complex networks and various dynamical processes taking place on them. The processes include epidemic spreading  and traffic flow . Such processes have potential applications in the control of stochastic systems [7–10]. It has been demonstrated that the structural properties of networks play an important role in determining the dynamical features of these processes .
As a paradigmatic dynamical process, random walks on complex networks  have been widely explored due to their basic dynamic properties and broad applications . In recent years, there has been increasing interest in random walks on small-world networks [13, 14] and scale-free networks [15, 16]. The structural properties affect deeply the nature of the diffusive and relaxation dynamics of the random walk [14, 16]. Such interest is well motivated since the random walks could also be a mechanism of search and routing on complex networks [17–21]. Random walks can be used to detect unknown paths , design dynamic routing in wireless sensor networks , and so on. Furthermore, to improve search performance, various modified random walks schemes have been proposed, such as self-avoiding walks  and coverage-adaptive walks .
Those modified random-walk strategies, however, are in most cases too complicated to be solved analytically. In addition, despite some studies of biased or preferential random walks [18, 24–26], a general framework for the scaling behaviour of the walks in networks with different topologies has not been available. That is to say, there is not a unified approach for understanding the behaviour of biased random walks. In this paper, we will develop a simplified random-walk model of unifying different random-walk strategies so that one could better understand results about mean first passage time (MFPT).
MFPT is an important characteristic of random walks on networks, which is investigated in various situations, especially in characterizing search efficiency [17, 19, 27]. The MFPT from node to , denoted by , is the expected steps taken by a walker to reach node for the first time starting from node . In complex networks, MFPTs of random walks heavily depend on the underlying network topology. MFPT of a single random walker in complex networks  has been extensively studied. For random walks on the family of small-world networks, mean field approximation was applied to get the analytic result for MFPT . By using Laplace transform, an exact expression for the MFPT of random walks on complex networks was derived . Adopting the theory proposed in  led to explicit solutions of the MFPT for random walks on self-similar networks . The solutions highlighted two strongly different scaling behaviours of the MFPT for different types of random walks. For random walks in a general graph, an explicit formula of the global MFPT to a trap node was provided . The formula is expressed in terms of eigenvalues and eigenvectors of Laplacian matrix for the graph.
However, those results about MFPT are in various forms and difficultly make a unified understanding. In many circumstances, they are not beneficial for revealing the interactions between the structural properties and random-walk dynamical behaviours. Moreover, the impacts of node strength on scaling properties of the MFPT remain less understood. To meet the above shortfall, we will attempt to establish a unified random-walk model in a tractable way. And we expect that some unified analytic results could be obtained for the statistics of the random-walk system. For this object, we take advantage of random walks on weighted networks and thus can make use of reversible Markov chains theory. Based on local information of the degrees of current node and its nearest neighbors, we attach different edge weights and then construct different random walks on weighted networks. We focus on preferential random walks (PRW) and simple random walks (SRW). We can consider the influence of node strength on the behaviour of random walks by PRW and SRW.
In the following, we develop a comprehensive approach for exploring the scaling behaviour of discrete-time random walks on complex networks. We mainly investigate PRW on complex networks and make comparative study with SRW. In Section 2, we give preliminaries and terminologies for random walks. In Section 3, we first attach weight to each edge and construct PRW through random walks on weighted networks. Then, we derive two exact expressions of the MFPT between two nodes for PRW on networks. One is a spectra formula obtained by the method of matrix analysis; the other is a probabilistic formula got by the method of stopping time. Accordingly, based on the two formulas for MFPT, we get the analytical formulas of the average over MFPTs (AMFPTs) between all node pairs. In Section 4, numerical simulations of an ensemble of random walkers moving on paradigmatic network models confirm analytical predictions and deepen discussions in different aspects. The network models include simple ER random networks, NW small-world networks, and BA scale-free networks. We discuss the effects of the structural heterogeneity on the MFPT and AMFPT. Through the comparison of PRW and SRW in networks, we unveil the CPD-based assortativity of network structure. We also interpret and handle some search-related issues by random walks, such as search efficiency in target problem, sensitivity of the total average search cost affected by the source node’s location, network searchability, and difference of the scaling behaviours for search cost among the three strategies of maximum-degree-search (MDS), PRW, and SRW.
2. Preliminaries and Terminologies
A simple random walk on a connected, undirected network with nodes is a Markov chain whose states are the nodes of . The walk begins with a walker at some node, and at each tick of the clock, the walker moves to a neighbor of its current position at random (uniformly). If instead the transition probabilities are biased according to edge weights, one obtains a general reversible Markov chain. In this section, we give a brief introduction to reversible Markov chains and random walks on weighted networks. We review basic concepts and some fundamental issues that are handy in proving our main results.
We describe a discrete-time Markov chain as follows: Consider a stochastic process with a finite state space . The process starts in one of these states and moves successively from one state to another. If the chain is currently in state , then it moves to state at the next step with a probability denoted by , and this probability is independent of the past states and depends only on the current state; that is, where , .
The probabilities are called one-step transition probabilities, which constitute the transition matrix of the chain. Accordingly, the -steps transition probabilities are , where is the -fold matrix product. Write and for probabilities and expectations for the chain starting at state and time 0. More generally, write and for probabilities and expectations for the chain starting at time 0 with distribution .
For the Markov chain with the state space , we say that the distribution is stationary or steady for the state space if ; that is, for any , . It is well known that any finite irreducible aperiodic Markov chain has exactly one stationary distribution . The stationary distribution plays the main role in asymptotic results as follows. We consider a finite irreducible Markov chain with the stationary distribution . Let be the number of visits to state during times . Then for any initial distribution ,If the chain is aperiodic, then, for all ,Further, in terms of the stationary distribution, it is easy to formulate the property of time reversibility [32, 33]: it is equivalent to saying that for every pair That is, in a chain with time reversibility, we step as often from to as from to . More vividly, given that a move of the chain runs forwards and the same move runs backwards, you cannot tell which is which. At this point, we call the chain reversible.
Now, we shift attention to random walks on weighted networks [35, 36]. We consider a finite nonbipartite network (or graph) with nodes (or vertices, sites) and edges connecting them. Here, we consider only a connected network; that is, there is at least one path linking any two nodes on the network. The connectivity is represented by the adjacency matrix with entries , . if there is an edge between nodes and ; otherwise . We also assume all conventionally. That is to say, the network we consider has no multiple edges and has no self-loops. The degree of node is defined as the number of connected neighbors; that is, . For the network , if , we assign a positive weight to edge ; otherwise, if , namely, the edge is absent, we attach weight . Writing for the function , we have obtained the weighted network [1, 37].
We define a random walk on the weighted network as a sequence of random variables , each taking values in the set of nodes. And the walk is such that if , namely, at time the walker is at node , then with the transition probability the walker hops to one neighbor at the next time ; that is to say, the walker randomly selects a neighboring node as its next dwelling point according to edge weights. Clearly, the walk can be described by a Markov chain with the finite space , whose transition matrix satisfies [35, 36]where . The sum , called the strength of node , runs over the set of all the connected neighbors of . Such a chain is reversible with the stationary distribution [35, 36]since . Note that is the total edge weight, when each edge is counted twice, that is, once in each direction.
In fact, by configuring the edge weights , we can get corresponding node strengths  and thus can control the scaling behaviour of the random walks. The weight heterogeneity could play an essential role in dynamical processes on networks , including random-walk dynamics. This may also have potential reference value in the control design for stochastic systems [38–41]. If we assign weight to each edge , then the random walk on the weighted network is a simple random walk. The transition matrix of the simple random walk is described byBy using (6), it is easy to prove that the unique stationary distribution of the simple random walk becomeswhere is the number of edges of the network .
3. Mean First Passage Time of Preferential Random Walks
In this section, we present a systematic study of preferential random walks in a general connected nonbipartite network with nodes and edges. MFPT is one basic characteristic of the random walks, since it contains a great deal of useful knowledge about the random-walk dynamics. We will derive two analytical expressions for MFPT between source node and target node, based on which we obtain the closed-form formulas of AMFPT between all node pairs. First, through applying the matrix analysis approach proposed in [42, 43], we obtain an exact solution to the MFPT, which is expressed in terms of the eigenvalues and eigenvectors of a matrix associated with the transition matrix of PRW. Then, by employing the stopping time technique developed in , we get a probabilistic formula for the MFPT, which provides the dependence of MFPT on the CPD of target node.
3.1. Formulation of PRW
To perform a random walk on a complex network, each node needs to calculate the transition probability from the node to each of its neighbors, but the knowledge available to this endpoint is limited to its local information. Thus the real question we need to ask is: what is the local information necessary and sufficient to calculate good transition probabilities at each node? In this paper, we implement preferential random walks on complex networks, in which the walker is prone to a high-degree neighboring node. Preferential random walks on complex networks are defined by following rule: Suppose a particle (or random walker) wanders on the network. It randomly selects a neighboring node as its next dwelling point according to the degrees of neighboring nodes. That is to say, the probability of heading to any neighboring node is , where denotes the degree, the number of connected neighbors, of a node , and denotes all the connected neighbors of node . Representing as , we can apply random walks on weighted networks to study preferential random walks and simple random walks as well. Thus, we can use a unified approach to explore preferential random walks and simple random walks.
If we attach weight to each edge , then the random walk on the weighted network is a preferential random walk with the transition matrix as follows:According to (6), the preferential random walk has a stationary distribution that is a unique probabilistic vector satisfying
There is a measure of node strength, that is, , in the definition of the PRW and the expression for the MFPT; see (9) and (43). We call it the center-product-degree of the node and denote it by . The heavily characterizes the behaviour of PRW on the network. There is a close relationship between and network assortativity . For a degree-correlation network, if the center-product-degree of node is an increasing function of the degree of node , then we say that the network is weekly assortative, whereas if the is decreasing function of , the network is strongly disassortative. Obviously, if the network is assortative, then it will be weakly assortative, while if the network is strongly disassortative, then it will be disassortative. We will numerically explore the CPD-based assortativity and homogeneity of network structure by random walks in Section 4.1.2.
In fact, the above-mentioned various types of biased random walks in networks [24–26] can also be transformed into random walks on weighted networks equivalently in similar way. For example, a biased random walk in uncorrelated networks and a biased lions-lamb model were introduced in [24, 25], respectively. In the two articles, the bias is defined by the preferential transition probability , where denotes the degree of a node and represents the set of node ’s nearest neighbors. We can attach edge weight and thus revisit the biased random walks. Another example is the Lévy random walks in  which can be got by configuring general weight between node and node where denotes the shortest path length.
Remark 1. The framework here, together with the following main results, may provide a unified approach to improve the understanding of the behaviour of various random walks in networks, especially biased random walks.
3.2. Main Results
For the sake of clearness, let us first remind the reader of basic notions and terms about the MFPT. For node , define two first passage times as As the random walks frequently start out at different initial nodes, it is important to distinguish the two first passage times. Write and , the angle bracket “” represents “Mean.” Given that , of course when ; in this case we call the first return time to node . Correspondingly,and we callthe mean first return time (MFRT) to node , that is, the mean number of steps needed to return to any starting point . On the other hand, if ,in this situation we call them the mean first passage time (MFPT) of from , namely, the expected time it takes to reach node starting from node . Occasionally, is also called the mean access time or the mean hitting time of from .
3.2.1. Method of Matrix Analysis
We now extend the matrix analysis approach developed in [42, 43] to compute the MFPT of a discrete-PRW walker to target node and the AMFPT. We thus get explicitly their dependence on the eigenvalues and eigenvectors of a matrix associated with the transition matrix of the PRW. We finish the calculation and derivation in the following two steps.(i)Diagonalizing the transition matrix of the PRWWe use to define one matrixwhere is a diagonal matrix, of which , .
Clearly, is symmetric due to the time reversibility of the PRW; namely, . Then can be diagonalized and has the same set of eigenvalues as . Let be the eigenvalues of , rearranged as , and let be the corresponding orthogonal eigenvectors of unit length. Here we take since the relation holds, . Hence we can describe in a spectral representation:Considering (15) and (16), one can easily obtainwhere ; that is, the entry of is .(ii)Constituting matrix with MFPTs and solving the matrix equation for Since the first step takes the walker to a neighbor of node with the probability , one hasif . According to (18), we can write an expression in matrix notationwhere any element of matrix is 1. Applying (18) says thatand hence is a diagonal matrix. The definition of the stationary distribution for the PRW indicates that Thus, That is to say,From (19)–(21), one immediately sees the matrix satisfiesWe will next solve this matrix equation for . Unfortunately, (22) cannot uniquely determine since does not have an inverse. But following , exists andwhereNote that ; from (23), one sees thatRecalling that in (12) and from (23) one hasFrom (25) and (26), we haveTo give explicitly the spectra formula for the MFPT , we will continue to do some calculation on . Substituting (17) into (24), we obtainRewriting the entries and of in (28) and plugging them into (27), we immediately get the following formula.Taking into account (45), together with (29), we can calculate the average over MFPTs (AMFPT) between all node pairs as follows.where (16) has been used.
Remark 2. Summing up the above equations and derivation, (29) and (30) are our one central result for the MFPT and AMFPT , which are expressed in terms of the eigenvalues and eigenvectors of related to the transition matrix of the PRW.
Remark 3. For SRW on the finite network, a similar result of (29) and (30) can be obtained from similar derivation above. The transition matrices of PRW and SRW, as two stochastic matrices, have similar spectral property . Combining with (30), this indicates that the AMFPTs s of PRW and SRW have similar scaling behaviour, which is also demonstrated in the following simulation in Section 4.2.
3.2.2. Method of Stopping Time
As we know, an integer-valued random variable is said to be a stopping time [33, 34] for the sequence , if the event is independent of , for all . The idea is that are observed one at a time: first , then , and so on; and represents the number observed when we stop. Notice that the above two first passage times, and , are stopping times associated with the PRW. After obtaining a spectra formula for the MFPT by the matrix formalism, we will use the stopping time technique to derive a probabilistic formula for the MFPT .
We now consider the PRW on the network, denoted by , which is a finite irreducible discrete Markov chain. Let be a stopping time such that and , and let be the number of times the PRW visits node in steps. Viewing the PRW as the renewal process with the interrenewal time distribution , from the reward-renewal theorem , one haswhich, together with (2), leads to 
Next, we will show that many formulas of time scale related to the PRW are encoded in (32) and thus can be derived from (32) by particularly choosing and . Further, we can combine these formulas to obtain the exact expression for MFPT . We would like to stress that this stopping time technique, including some formulas such as (38), (41), and (42) inferred by the technique, was proposed in . We can also seek the sight of the method in the classical Markov theory [32, 34]. However, by using this method, we focus on the two aspects. On one hand, we use the method to get some new rigorous mathematical results for random walks on complex networks. On the other hand, we can apply this “probabilistic” approach to explore characteristics of dynamic processes in a random-walk fashion such as random search, communication, and transportation in complex networks.
Taking in (32), one hasSetting givesUsing (33) and (34), we are led to an explicit expression for the MFRT to node as follows:Introducing as “the first return to after the first visit to ,” for , one hasbecause there are no visits to before time . Obviously,Substituting (36) and (37) into (32), we obtain the relationLet us assume that the PRW starts out from node in the network. We fix a time and set as the following 2-stage stopping time: (i) wait time and then (ii) wait until the PRW next passages if necessary. Then (32), in the case where , implieswhere
For the PRW on the finite network, the MFPT of node from node iswhereconsequently, the AMFPT between all node pairs issince for all .
For the SRW on the finite network, by using the Laplace transform, the authors got similar theoretical result of MFPT in , given bywhere
Remark 4. Compared with their method, the method here, that is, the stopping time technique, may be more “probabilistic.” In fact, their result of (46) can also be obtained by this method. The key of the method lies in properly choosing the stopping time in (32), which seems to be a little tricky. It is worth noting that a special selection of can derive many other characteristic parameters. The MFPT in (43) or (46) is just one example. Thus, the stopping time technique may provide a powerful tool for understanding the scaling behaviour of random walks on complex networks.
From (43) and (46), the following equation can be got straightforwardly. Considering the SRW and PRW on the same finite network, if the node satisfiesthen the mean first return times s of SRW and PRW starting from are equal.
Remark 5. As (43) and (46) show, the MFRT of SRW on the network is determined by the starting node’s degree and inversely proportional to it, while the one of PRW starting out from node is determined by and inversely proportional to . The MFPT of SRW on the network mainly depends on the degree of target node , while the one of PRW mainly depends on . Simulations confirm analytical predictions and deepen discussions in Section 4.
Remark 6. In (43)–(47), is an important quantity closely related to the mixing time of random walk . The quantity depends on the network structure and the type of random-walk strategy. Given that the mixing time is , can be used as the approximation of . From the numerical results of random walks on NW small-world networks (and BA scale-free networks) presented in Figure 2 (and Figure 3) and according to (48), we find that the value is greater than 1 but very close to 1.
Remark 7. From (30) and (45), the average over MFPTs from an arbitrary node to all other target nodes is identical to the AMFPT between all node pairs, where node or node is randomly chosen from all nodes according to the stationary distribution. This implies the average over MFPTs from a source node to all possible target nodes is not sensitively affected by the source node’s location; numerical results are shown in Section 4.2.1.
4. Simulations and Applications
In this section, we make use of numerical simulation to deepen our discussions as well as confirm analytic results. In Section 4.1, based on theoretical results of (43), (46), and (29), we numerically explore the scaling properties of MFPT. Firstly, we use a simple random network to test the first passage property of the PRW. Secondly, we reveal topological properties of the NW small-world network such as assortativity and homogeneity through PRW and SRW. Then, through the comparison of PRW and SRW on the BA scale-free network, we investigate how the heterogeneous structure affects the scaling of MFPT. We also observe that PRW searches for the relatively high-degree node more quickly than SRW. In Section 4.2, based on theoretical results of (30) and (45), we numerically investigate the scaling behaviours of AMFPT. We find that the average over MFPTs from an arbitrary node to all other target nodes is identical to the AMFPT. We discuss the effects of the structural heterogeneity/homogeneity on the scaling of AMFPT. Further, we observe that for random walks on the BA scale-free network the AMFPT demonstrates approximatively linear scaling with the node number, that is, , and does not have the small-world feature, although the average shortest path length of the network has the small-world effect. This phenomenon also appears in the NW small-world network. The observation, to some extent, characterizes the network searchability . Finally, we compare the scaling behaviours of average search steps among SRW, PRW, and maximum-degree-search (MDS) strategy. We explain why the scaling behaviours of average search steps for PRW and SRW are much similar, while being utterly different from the one for MDS.
4.1. Scaling Properties of MFPT
4.1.1. PRW on a Simple Random Network
The small connected random network is defined as labelled nodes and every pair of the nodes being connected with probability by using the ER model . The average degree of the simple random network is ; namely, . We perform PRW on the simple random network. Numerical data presented in the figures have been averaged over runs.
We perform PRW on the simple network; see Figure 1. For several nodes arbitrarily selected, both the analytical and numerical results presented in Table 1 claim that . As is shown in Figure 1, our simulation states the MFPT of PRW on networks mainly depends on and is almost inversely proportional to the target node’s center-product-degree, that is, , which is also found in (43). That is, the simulation values of are in good agreement with theoretical predictions.
4.1.2. PRW on Small-World Networks: Comparison with SRW
The small-world network is generated by the method introduced by Newman . In this network model, no edges are rewired, which is different from the small-world model proposed by Watts and Strogatz . Instead shortcuts joining randomly chosen node pairs are added to the low-dimensional lattice. The size of the network is , the neighboring number is , and the probability of shortcuts is . The average degree of the generated small-world network is . We perform PRW and SRW on the small-world network, respectively. Numerical data presented in the figures have been averaged over runs.
As shown in Figures 2(a) and 2(c), for SRW on the NW small-world network, the MFRT is determined by node’s degree , while for PRW, is determined by node’s center-product-degree . Similar observation happens to the MFPT due to the fact that the value is greater than 1 but very close to 1. In detail, for SRW on the NW small-world network, such value can be got from (48) and numerical results presented in Figures 2(a) and 2(b), while, for PRW, the value can be obtained from (48) and Figure 2(c). This further confirms the conclusions of (43) and (46) and improves the understanding of them.
(A) CPD-Based Assortativity. It is worth noticing that the random walks can be applied to reveal many different properties of network topology. Here is an example. One may be pleasantly surprised that and for SRW are determined by target node’s degree as well as for PRW; see Figures 2(a) and 2(b). In fact, from Figure 2(c) or the analytic prediction of (43), and of PRW are mainly determined by and almost inversely proportional to . Hence, this observation indicates that the center-product-degree of one node and the degree maintain consistency. That is, of one node is an increasing function of for the NW small-world network. Thus, the NW small-world network considered here is weakly assortative, which, to a certain extent, reflects a homogeneous structure of the network.
(B) Search Efficiency. We compare SRW and PRW simultaneously on the same NW small-world network; see Figures 2(a) and 2(b). When the node’s degree is sufficiently high, all s and s of PRW are smaller than those of SRW. It implies that PRW prefers the node with higher degree, which is in accordance with the analytical prediction of (49). This has some practical meanings. If PRW and SRW, as search processes on networks, search for target node with sufficiently high degree, the search time (walking steps) of PRW is much less than that of SRW. That is, in this case PRW searches more quickly and more efficiently.
4.1.3. PRW on Scale-Free Networks: Comparison with SRW
The scale-free network is generated by using BA model , with and network size . The scale-free network generated in such a way has an exponent of which the average degree is 4; namely, . We perform PRW and SRW on the scale-free network, respectively. Numerical data presented in the figures have been averaged over runs
(A) The Impacts of Structural Heterogeneity on the Scaling of MFPT. For SRW on the BA scale-free network, and are mainly determined by node’s degree, whereas for PRW the two quantities fluctuate with node’s degree; see Figures 3(a) and 3(b). Combining with Figure 3(c), it is easily seen that node’s degree and center-product-degree in the BA scale-free network do not maintain consistency. This is entirely different from the above NW small-world network; see Figure 2. The difference is mainly because the degree distribution of the BA network has a power-law tail, or the BA network has a structure of heterogeneity. In fact, the weight allocation could play an important role in random-walk dynamics. The above observation also suggests that one can control the scaling behaviour of the random walks by configuring the edge weights. It should be emphasized that and of PRW mainly depend on the node’s center-product-degree rather than degree . The discussion here may improve the understanding of the result in , where the authors studied biased random walks in uncorrelated networks and only explored the impacts of node’s degree on the MFPT.
(B) Target Problem on Scale-Free Networks. Considering SRW and PRW as search strategies on networks, PRW prefers the high-degree node, while SRW searches for the relatively low-degree node more efficiently; see Figures 3(a) and 3(b). Since the scale-free network has a heterogeneous structure evidenced by the power-law degree distribution, this inspires us to propose a mixing navigation mechanism for search in scale-free networks, which interpolates between SRW and PRW. That is, to design the search strategy from source node to target node, one can firstly compare the size between the two nodes’ degrees. If the target’s degree is significantly higher than the source’s degree or both of them are relatively high, then one could use PRW to search; otherwise one could use SRW alternatively.
4.2. Scaling Behaviours of AMFPT
In this part, the paradigmatic network models used are the same as those in Section 4.1. Based on the above discussion, we further numerically investigate scaling behaviours of AMFPT.
4.2.1. Sensitivity of the Total Average Search Cost Affected by the Source Node’s Location
From Figure 4, one can see that the theoretical prediction of (30) and (45) agrees quite well with the numerical calculations. As expected, for PRW or SRW on different types of networks with different sizes , for example, the BA scale-free network, the average MFPT from any one source node to all other destination nodes is equal to the AMFPT between all node pairs. Similar result was obtained for Koch networks . Such result is interesting and one could still look into its further meaning. On one hand, this implies the average of MFPTs from a source node to all other destination nodes is not sensitively affected by the source node’s location. On the other hand, if the PRW and SRW are two kinds of routing processes on scale-free networks, the total average search cost could be calculated by averaging from one site selected at random.
4.2.2. The Effects of Structural Heterogeneity on the Scaling of AMFPT
For the BA scale-free network with size , the AMFPT of PRW is much greater than that of SRW; see Figure 5(a). That is, considering PRW and SRW as search strategies, the total average search cost of PRW is significantly higher than that of SRW. This is due to two reasons. One is that, compared with SRW, PRW tends to searching for the high-degree node; the other is that the degree distribution of the BA scale-free network is approximated by a power-law distribution; that is, the network has a heterogeneous structure. A few nodes have a large number of connections while most nodes have only a few connections. Thus, although PRW searching for high-degree nodes has high efficiency, to search for other nodes, PRW is prone to falling into the high-degree-node trap and difficultly reaches those nodes with only a few connections. All of these lead to the occurrence of the above phenomenon. Meanwhile, for the NW small-world network, there is little difference in the AMFPT between PRW and SRW, which is due to the fact that the degree distribution of the network is approximately Poisson distribution; that is, the network has a homogeneous structure; see Figure 5(b).
4.2.3. Network Searchability
As the actual average searching path length, the AMFPT of the random walk on the network can be regarded as one generalization of the average shortest path length, which, to some extent, characterizes network searchability . The average shortest path length of the BA network considered here obeys . The AMFPT , however, satisfies for either PRW or SRW on the BA network; see Figure 5(a). Similar phenomenon happens to the NW network; see Figure 5(b). That is, in either case the actual average searching path length, that is, the AMFPT , does not have the small-world effect. In short, the fact that a network has the small-world effect does not necessarily guarantee that it can be rapidly searched for.
4.2.4. The Difference of Scaling Behaviours for Search Cost among MDS, PRW, and SRW
The numerical result presented in Figure 5(a) shows that the AMFPT satisfies for either PRW or SRW on the BA network. The observation states that the leading scaling behaviours of between PRW and SRW are much similar, which is in accordance with the analytical result of (30). Incidentally, the conclusion just solves the authors’ puzzlement in . They applied MDS strategy to path finding in one scale-free network. In the MDS strategy, the neighbor node with the largest degree is tried first. Their results showed that the global average search steps of MDS present small-world feature, . They were puzzled by the fact that PRW and MDS strategies show very different scaling behaviours although both look quite similar, while PRW and SRW strategies demonstrate similar scaling behaviour. The reason for the fact is described as follows. The corresponding transition matrices of PRW and SRW are stochastic matrices and have similar spectral property , which implies s of the two walks having the similar scaling behaviour due to (30). On the other hand, the PRW is one probabilistic degree-preferred mechanism, while the MDS is one deterministic degree-preferred strategy and the SRW is a uniform mechanism. The PRW incorporates the local degree-preferred element and the randomness ingredient, which in this sense can be regarded as a mixing strategy of SRW and MDS. Thus, their puzzlement just highlights the fact that, for PRW on the BA networks, the leading scaling behaviour of AMFPT is dominated by the randomness ingredient of the PRW.
In summary, we have developed a unified approach for understanding the scaling properties of discrete-time random walks on complex networks. Our work may be of practical significance for performing efficient search on complex networks and controlling the scaling behaviour of random walks on real-world networks.
We presented a systematic study of PRW in general undirected networks, including complex networks. We also made comparative study of PRW and SRW in order to better uncover and utilize the network structure. According to random walks on weighted networks, we attach weight to each edge , where and are the degrees of and , and then construct PRW, of which the transition probability from node to node is proportional to the edge weight. We derived two exact expressions for the MFPT between two nodes, one of which is a spectra formula and the other is a probabilistic formula [see (29) and (43)]. We got explicitly the MFPT’s dependence on the eigenvalues and eigenvectors of a matrix associated with the transition matrix of the PRW [see (29)]. We found that the CPD plays a main role in determining the scaling of MFPT for the PRW [see (43)]. The CPD of node , being one measure of node strength, is defined as , where denotes all the connected neighbors of node . Accordingly, we obtained the closed-form formulas of AMFPT between all node pairs and observed that the average over MFPTs from an arbitrary node to all other target nodes is equal to the AMFPT [see (30) and (45)].
Based on theoretical analysis, we did extensive simulations to confirm analytical predictions and deepen discussions. Through the comparison of PRW and SRW in networks, we revealed the CPD-based assortativity of network structure and found that the structural heterogeneity/homogeneity has a considerable impact on the scaling of MFPT and AMFPT. If we consider various random walks as search strategies applied to target problems, the MPFT between source and target characterizes search efficiency. The AMFPT represents the total average search cost, which, to some extent, can describe network searchability. We demonstrated that PRW prefers the high-degree node while SRW searches for the low-degree node more efficiently. We also found that the average over MFPTs from a source node to all possible destinations is not sensitively affected by the source node’s location. As we observed, the average path length between nodes of a complex network possessing small-world effect does not necessarily guarantee that one could perform search rapidly in the network. By comparing the search strategies of MDS, PRW, and SRW, we confirmed that the leading scaling behaviours of average search steps for PRW and SRW are much similar, while being utterly different from the one for MDS.
In the current work, we consider two paradigmatic types of single random walks on weighted network, that is, PRW and SRW corresponding to edge weights and . The generalization to more types of weight configurations would be interesting. Further, one could configure proper weights to develop proper multiple random walks for some practical applications such as improving the reliability and efficiency of searching for networks and identifying the influential nodes of real networks . We leave these more intriguing problems to future studies.
Conflicts of Interest
The authors declare that there are no conflicts of interest regarding the publication of this paper.
This work is partially supported by Soft Science Research Project of Shanghai Songjiang Science and Technology Commission under Grant no. 17SJRKT40; Soft Science Research Project of Shanghai Science and Technology Commission under Grant no. 17692109000; National Natural Science Foundation of China, under Grant nos. 11471211, 11171018, and 61402281; and Shanghai Natural Science Fund Project under Grant no. 14ZR1418900.
X. Zhao, P. Shi, X. Zheng, and L. Zhang, “Adaptive tracking control for switched stochastic nonlinear systems with unknown actuator dead-zone,” Automatica. A Journal of IFAC, the International Federation of Automatic Control, vol. 60, pp. 193–200, 2015.View at: Publisher Site | Google Scholar | MathSciNet
H. Wang, W. Sun, and P. X. Liu, “Adaptive intelligent control of nonaffine nonlinear time-delay systems with dynamic uncertainties,” IEEE Transactions on Systems, Man, and Cybernetics: Systems, no. 99, pp. 1–12, 2016.View at: Google Scholar
R. Durrett, Random graph dynamics, Cambridge University Press, Cambridge, UK, 2007.
J. D. Noh and S. Kim, “Random-walk and pair-annihilation processes on scale-free networks,” Journal of the Korean Physical Society, vol. 48, pp. 202–207, 2006.View at: Google Scholar
C.-M. Angelopoulos, S. Nikoletseas, D. Patroumpa, and J. Rolim, “Coverage-adaptive random walks for fast sensory data collection,” Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6288, pp. 81–94, 2010.View at: Publisher Site | Google Scholar
S. M. Ross, Stochastic Processes, John Wiley, New York, NY, USA, 1996.View at: MathSciNet
Z. T. Zheng, Exploring complex networks by random graph evolution and random walks [Ph.D. Dissertation], Shanghai University, Shanghai, China, 2009.
L. Lovász, “Random walks on graphs: a survey,” in Combinatorics, Paul Erdös is eighty, vol. 2, pp. 1–46, János Bolyai Mathematical Society, Budapest, Hungary, 1993.View at: Google Scholar
C. M. Grinstead and J. L. Snell, Introduction to Probability, American Mathematical Society, Providence, RI, USA, 1997.
F. R. Chung, Spectral Graph Theory, American Mathematical Society, Providence, RI, USA, 1997.View at: MathSciNet