# Random Walks on deterministic Scale-Free networks: Exact results

###### Abstract

We study the random walk problem on a class of deterministic Scale-Free networks displaying a degree sequence for hubs scaling as a power law with an exponent . We find exact results concerning different first-passage phenomena and, in particular, we calculate the probability of first return to the main hub. These results allow to derive the exact analytic expression for the mean time to first reach the main hub, whose leading behavior is given by , where denotes the size of the structure, and the mean is over a set of starting points distributed uniformly over all the other sites of the graph. Interestingly, the process turns out to be particularly efficient. We also discuss the thermodynamic limit of the structure and some local topological properties.

###### pacs:

05.40.Fb,89.75.Hc^{†}

^{†}preprint: APS/123-QED

## I Introduction

In the last few years, one of the most studied topic in network theory has been the investigation of highly inhomogeneous structures. Networks with strong variability in local metric and topological properties have been shown to well represent many real structures, occurring in nature and in man-made systems. Condensed matter and soft materials often feature an inhomogeneous organization in space comb (), and even engineered devices can be constructed to reproduce a highly varying arrangement, in order to obtain the designed physical properties Levy (). Such networks, being physically embedded in space, are finite dimensional and it is known that in this case inhomogeneous topology can strongly affects physical phenomena occurring on the network itself.

Graphs are also used to describe the generic relation between a set of elements or agents, as it happens in complex networks theory in biology, social science, computer science and economy AB (); dor (). Then, these networks often feature infinite dimensionality, and inhomogeneity has been detected in several real systems blumen (); blumen2 (); gallos (); condamin (). One of the most studied structures in the literature are Scale-Free (SF) networks, which show a degree sequence scaling with a characteristic power law AB (); fal (). This implies that highly inhomogeneous regions can be present in the network.

Random structures and stochastic approaches have appeared to be very useful in this framework, even if, in real cases, one always has to deal with a single realization of the disorder. Due to the strong variability of the topology in the samples, the quenched properties could not coincide with the behavior found in the typical cases, as described by the probability distribution. Therefore, the study of quenched samples and deterministic topologies is a very interesting task zhang (); zhang2 (); haynes (); kozak2 (); bollt (); kittas ().

Apart from the discussion on how and why structures with scaling degree sequences are so often encountered in nature doyle1 (), they certainly represent a new and interesting class of inhomogeneous graphs. Original techniques have been developed in order to characterize these topologies and their effect on physical properties. However, the general topological and metric features of SF graphs, on the global and on the local scale, are still not completely understood.

Random walks are one of the simplest stochastic processes affected by the topology of a network and, at the same time, the basic model of diffusion phenomena and non-deterministic motion. They have been extensively studied for decades on regular lattices weiss (), fractal networks and finite dimensional inhomogeneous structures havlin (), where they have been shown to be able to evidence a new and unexpected phenomenon arising in presence of strong inhomogeneity, namely the splitting between local and average properties burioni (). The richer topology of a generic, inhomogeneous and infinite dimensional graph can have a dramatic effect on the properties of random walks, especially when considering infinite graphs, which are introduced to describe macroscopic systems in the thermodynamic limit. Random walks represent not only a good model for diffusion phenomena on large complex networks, but also a direct way to characterize their large scale topological features, also in presence of strong inhomogeneity, and their influence on physical properties. Once these are known, they could also be used to fruitfully design and engineer a network topology with given properties.

In this paper we want to deepen the analysis by studying random walks on a specific Scale-Free topology, namely a deterministic Scale-Free network, built in a recursive way and featuring a scaling distribution for the hub degrees, with an exponent . For this deterministic structure, first introduced in barabasi (), some metrical and spectral properties have recently been investigated in details iguchi (). On the other hand, how these properties are linked to diffusion processes on the network is still an open problem.

Using the formalism of random walks generating functions weiss (), we derive exact expressions for the first passage times redner () for a random walker starting from the maximally connected hub and from the last generation “rims” of the deterministic SF network. In particular, we investigate their dependence on the size of the network and we derive an exact expression for the mean time to first reach the most connected hub, namely the mean time to absorption if we place a perfect trap on the most connected hub. This quantity displays an extremely slow behavior as the size of the network increases, given by , where denotes the size of the structure, and the mean is over a set of starting points distributed uniformly over all the other sites of the graph. Interestingly, the trapping process appears to be very efficient. We also obtain an implicit relation for the generating function of the first passage probabilities from the hub to rims, and viceversa, which provides some insight into the leading singularity for the generating function of the return probability to the hub. In particular, we prove the recurrence of the main hub by exploiting the connection between random walks and electric networks doyle (). Moreover, we compare the return probability to the main hub with the return probability to an end-node evidencing a very different asymptotic behavior. All the results are checked with extensive numerical calculations.

The paper is organized as follows: In Sec. II we give a brief mathematical description of the deterministic Scale-Free graph, introducing the language and the formalism we will use in the whole article. Then, in Sec. III we derive the recursive relation between the first passage probabilities from hubs to rims and vice versa; from these we calculate the exact expression for the mean time to first reach the most connected hub and its dependence on the volume of the network. In Sec. IV we calculate the return probability on the main hub and we discuss its recurrence in the thermodynamic limit. Finally, Sec. V is devoted to conclusion and discussion.

## Ii Deterministic Scale-Free network

A generic graph consists in a non-empty set of nodes joined pairwise by a set of links harary (). Here we consider a particular set of deterministic graphs , first introduced in barabasi (), which can be built recursively: At the -th iteration one has the graph of generation , denoted by (see Fig. 1).

Starting from the so called root constituted by one single node labeled as , at the first iteration one introduces two more nodes and connects each of them to the root; the resulting chain of length three represents the graph of generation . We call the set of sites added at the first generation and linked to the root. Then, at the second iteration one adds two chains of length three and connects each end node to the root, namely , so that the root will increase its coordination number from to . Proceeding analogously, at the -th iteration one introduces two replica of the existing graph of generation and connects the root with each site making up .

Hence, at the -th generation the root turns out to be the main hub with coordination number , the set of all nodes has cardinality and . As shown in barabasi (), exhibits “hubs” with degree , being . As a result, the tail of the degree distribution is a power law with exponent . However, this does not hold for the so called “rims” contained in the sets . In this case one finds , where , which shows that the scaling nature of the rims is not scale-free but exponential iguchi (). The topological and spectral properties of this graph have been deeply analyzed in iguchi () where, in particular, the average degree is shown to be , namely it approaches as . Indeed, on the one hand the graph becomes very complex and there exists a set of few [] nodes whose coordination number grows indefinitely, on the other the number of nodes with degree become large indefinitely; as a result the average degree remains finite, conversely the second moment is divergent. It should also be underlined that by increasing the number of cycles grows fast; as a result, while the number of end-nodes grows linearly with the volume (), the average distance from the main hub increases only logarithmically with ().

## Iii Generating functions and first passage properties

The simple random walk (RW) on a graph is defined by the jumping probability between nearest neighbor sites and :

where and is the coordination number of site . Therefore, the probability of reaching in steps site starting from is

(1) |

In the following we denote with the probability that a RW on , starting from a site reaches the site with label at time and the probability that the same walk reaches the site for the first time at time . Moreover, we consider the probability that, at the generation , a walk starting from any site in first reaches the central hub and the probability that a walk starting from the central hub first reaches any site in .

Now, the following equations hold

(2) |

and

(3) |

Some comments are in order here. In a graph of generation , each rim is connected to nodes of which one is the main hub; this accounts for the first term in Eq. 2. The remaining links connect each rim to a minor hub from which one can reach the main hub only passing through a rim; this explains the sum of convolutions in Eq. 2. Analogously, from the main hub links out of point directly to a rim; the remaining links connect the main hub to nodes corresponding to rims of graphs of generations and from such nodes one can reach any site in only through the main hub itself.

The generating functions corresponding to Eq. 2 and Eq. 3 read as

(4) |

and

(5) |

Notice that, as can be easily inferred from Fig. 1, , from which . We also recall that, by definition, is just the probability to ever reach the hub from any site in and, analogously, is the probability to ever reach any site in from . Of course, for finite one has . With some algebra we rewrite Eq. 4 and Eq. 5 respectively as

(6) | |||

(7) |

Moreover, by properly handling Eq. 6 and Eq. 7 we can obtain the following two finite-difference equations coupled together:

(8) | |||

(9) |

which can be combined together to get the rather symmetric expression .

It is interesting to notice that, since , for any and for any , from Eq. 6 we have , from which one gets . Hence, in the thermodynamic limit the probability to eventually reach the hub from is zero.

From Eq. 6 and Eq. 7 it is possible to calculate recursively and ; for instance, for the first generations we get

(10) | |||||

(11) | |||||

(12) |

and

(13) | |||||

(14) | |||||

(15) |

The generating functions and allow to calculate the average time taken by a random walk started on a site in to reach the hub and the average time taken by a random walk started on the main hub to reach any site in , respectively. In fact, for any arbitrary generation we can write:

(16) | |||

(17) |

Hence, deriving Eq. 6 and Eq. 7 and recalling that for finite structures , we find the following coupled equations:

(18) | |||||

(19) |

Notice that the previous two equations could be obtained directly from Eq. 2 and Eq. 3 by multiplying both sides by and summing over .

Now, from Eq. 18 and Eq. 19 we get

(20) | |||||

(21) |

Such equations can be properly handled to get

(22) |

and

(23) |

whose solution is given by

(24) |

and

(25) |

where we used .

Interestingly, and both display the same exponential law: The average time to first reach the hub from any of the sites making up and the average time to first reach any site in from the hub grows with the generation as . Also, recalling that and that , we can write and get .

The average times and found above are useful to calculate the mean time to absorption . In fact, let us define the mean time necessary to first reach the hub from site , then and we can write

(26) |

namely

(27) |

where and is the set of sites added at the -th generation. We now notice that the last sum in Eq. 27 is just given by

(28) |

where the first two terms simply allow for rims and nodes bridging between two rims; then, from the remaining nodes making up one can reach the main hub by passing through any rim, possibly via a minor hub, and this yields to the last sum.

By replacing in the previous equation the expressions for and found in Eqs. 24, 25 we get

(29) |

which, together with Eq. 27 yields

The solution of this recursive equation is

(30) |

whose leading behavior is given by

(31) |

with . Such an exponent is even lower than the exponent found in zhang () for a deterministic scale-free network displaying the power degree . Indeed, the multi-fractal nature displayed by the graph under study gives rise to a remarkable efficiency for trapping on .

### iii.1 Numerical calculations

For a generic graph, given the corresponding adjacency matrix and the coordination matrix , the numerical calculation of the mean time to absorption can be performed by exploiting a differential equation where the normalized discrete Laplacian appears kozak (); agliari (); zhang (); zhang2 (). More precisely, for the topological structures analyzed here, the Laplacian is a matrix which depends on the generation and we have

(32) |

Therefore, the mean time to absorption averaged over all possible starting sites reads as:

(33) |

In Fig. 2 we compare the analytical results of Eq. 30 and of Eq. 31 with the numerical results obtained via Eq. 33.

## Iv Return probability

The results found in the previous section allow to deepen the analysis of the random walk problem on the determinist structure considered. In particular, the probability that a random walk started on the hub returns to the hub itself for the first time after time has the form

(34) |

and the pertaining generating function is

(35) |

By replacing the expression for appearing in Eq. 9, we get the telescopic sum , so that Eq. 35 simplifies into

(36) | |||||

which highlights that the probability to first return on the hub at generation directly depends on the probability to first reach any site in starting from . We also notice that for finite , , that is the hub is a recurrent point, as expected for any point on finite graphs burioni ().

Interestingly, from Eq. 34 we can explicitly derive the average time to first return to the main hub as a function of :

(37) |

where in the last equality we used the result of Eq. 24. Therefore, for large structures we have , which is the same leading behavior found for and . This result is also consistent with Kac formula kac () according to which .

From we can now calculate burioni (): using Eq. 6 and Eq. 36 we get

(38) |

(39) | |||||

(40) | |||||

(41) |

We checked up to generation that can be written as

(42) |

where and are even polynomial of degree (in fact all possible cycles have even length), both devoid of any factor and satisfying . In Fig. 3 we show data for and for , being and , both obtained numerically from Eq. 1: . Interestingly, the decay displayed by the two probabilities considered is significantly different, which provides a further evidence of the strong inhomogeneity of the graph.

Once the thermodynamic limit is taken, a divergence in for would imply that the main hub is recurrent burioni (). Recurrence can alternatively be proven by exploiting the connection between random walks an electric networks. The escape probability can be determined by calculating the effective resistivity at fixed distance from the hub, when all the links of the network are replaced by unit resistors and a unit voltage is applied between the hub and the points at fixed distance from it. Then, taking the thermodynamic limit, the relation between the escape probability from the hub and the effective resistivity of the network reads doyle ():

(43) |

where, we recall, is the coordination number of the hub at generation . Therefore, if diverges in the thermodynamic limit, the hub is recurrent, while if it converges to a finite value, there is a finite probability of escape from the hub. On highly inhomogeneous graphs such as our scale-free networks, however, a vanishing may not necessarily imply that the mean number of visits to the hub is infinite prep ().

In general, when the unit voltage is applied to the resulting circuit, by symmetry one can detect nodes which are at the same voltage (e.g. the rims) and short them together without affecting the distribution of currents in the branches, nor the effective resistivity. In this way, by applying the standard rules for the sum of resistors in series and in parallel, one can build an equivalent network for the circuit, in terms of the total resistivity. To better exploit the symmetry properties of the network, we consider only even values of , so that the points at a maximum distance from the hub are topologically equivalent (an analogous relation can be easily obtained if only odd values of are considered). With some algebra one then obtains:

(44) |

holding for even . Hence, recalling that we derive that the main hub is recurrent.

## V Conclusion and Discussion

In this work we studied the random walk problem on a class of deterministic networks exhibiting both a scale-free, , and an exponential, , degree distribution. The latter holds for a subset of nodes called rims which are at a distance from the main node. Adopting a generating function formalism we calculate the exact average time to first reach the hub, where the mean is taken over all possible walks connecting a site to the hub and over all starting nodes . The leading behaviour for turns out to be , where is the total number of sites making up the network. Analogous power-law behaviours were found previously for exactly decimable fractals kozak (); agliari () as well as for other deterministic scale-free networks zhang () and Apollonian networks zhang2 (), however the structure considered here results remarkably effective, being . The reason lays in the large number of cycles and in the multi-fractal nature of the the graph under study which determines a very short average distance from the main hub.

In the second part of the work we focused on the probability to first return to the main hub and we obtained a recursive formula for its generating function which allows to get some insight into the local topological properties of the hub. In particular, the recurrence of the hub is proved by mapping the graph into an electrical network whose effective resistivity provides the escape probability from the hub. Hence, in the thermodynamic limit, a splitting between average and local properties occurs: transience in the average is expected due to the diverging dimensionality, while the hub is locally recurrent.

Finally, we compared the return probability to the main hub with the return probability to one of the outer nodes evidencing different asymptotic behaviors. This further highlights the strong inhomogeneity of the graph considered.

## Acknowledgments

The authors would like to thank Olivier Bénichou, Raphael Voituriez and Alessandro Vezzani for useful and interesting discussions during the late stage of the work.

## References

- (1) T.T. Perkins, D.E. Smith, R.G. Larson, S. Chu, Science 268 83 (1995)
- (2) P. Barthelemy, J. Bertolotti and D. Wiersma, Nature 453 495 (2008).
- (3) R. Albert and A.-L. Barabasi, Rev. Mod. Phys. 74, 47 (2002).
- (4) S.N. Dorogovstev and J.F.F. Mendes Evolution of Networks: From Biological Nets to the Internet and WWW, Oxford University Press, Oxford, 2003.
- (5) G. Oshanin, O. Bénichou and A. Blumen, J. Stat. Phys. 112, 541 (2003).
- (6) A. Blumen and F. Jasch, J. Phys. Chem. A 106, 2313 (2002).
- (7) L.K. Gallos and P. Argyrakis, Phys. Rev. E, 74, 056107 (2006).
- (8) S. Condamin, O. Benichou, V. Tejedor, R. Voituriez and J. Klafter, Nature 450, 77 (2007).
- (9) M. Faloutsos, P. Faloutsos and C. Faloutsos, Comput. Commun. Rev. 29, 251 (1999)
- (10) Z. Zhang, Y. Qi, S. Zhou, W. Xie and J. Guan, Phys. Rev. E 79, 021127 (2009).
- (11) Z. Zhang, J. Guan, W. Xie, Y. Qi and S. Zhou, Europhys. Lett. 86 10006 (2009).
- (12) C.P. Haynes and A.P. Roberts, Phys. Rev. E 79, 031111 (2009).
- (13) J.J. Kozak, Adv. Chem. Phys. 115, 245 (2000).
- (14) E.M. Bollt and D. ben-Avraham, New J. Phys. 7, 26 (2005).
- (15) A. Kittas, S. Carmi, S. Havlin and P. Argyrakis, Eur. Phys. Lett. 84 4008 (2008).
- (16) L. Li, D. Alderson, J. C. Doyle and W. Willinger, Internet Math., 2, 431 (2005)
- (17) G.H. Weiss, Aspects and Applications of the Random Walk, North-Holland, Amsterdam, 1994.
- (18) D. ben-Avraham and S. Havlin, Diffusion and Reactions in Fractals and Disordered Systems, Cambridge University Press, 2004.
- (19) R. Burioni and D. Cassi, J. Phys. A 38, R45-R78 (2005).
- (20) A.-L. Barabási, E. Ravasz and T. Vicsek, Phys. A 299, 559 (2001).
- (21) K. Iguchi and H. Yamada, Phys. Rev. E. 71, 036144 (2005).
- (22) S. Redner, A Guide to First-Passage Processes, Cambridge University Press, New York, 2001.
- (23) P.G. Doyle and J.L. Snell, Random Walks and Electric Networks, The Mathematical Association of America, Inc., Washington, D.C. (1999)
- (24) F. Harary, Graph Theory, Addison-Wesley, Reading, MA, 1969.
- (25) J.J. Kozak and V. Balakrishnan, Phys. Rev. E 65, 021105 (2002).
- (26) E. Agliari, Phys. Rev. E 77, 011128 (2008)
- (27) A.N. Samukhin, S.N. Dorogovstev and J.F.F. Mendes, Phys. Rev. E 77, 036115 (2008).
- (28) E. Agliari, R. Burioni and A. Manzotti, in preparation.