Random walks and diameter of finite scale-free networks

Details Random walks and diameter of finite scale-free networks Random walks and diameter of finite scale-free networks

2007-01-04

arxiv.org/abs/cond-mat/0701070v1

Physics

Condensed Matter

Statistical Mechanics

4 pages, 4 figures

Scientific paper

10.1016/j.physa.2008.01.101

Dynamical scalings for the end-to-end distance $R_{ee}$ and the number of distinct visited nodes $N_v$ of random walks (RWs) on finite scale-free networks (SFNs) are studied numerically. $\left< R_{ee} \right>$ shows the dynamical scaling behavior $\left= \bar{\ell}^\alpha (\gamma, N) g(t/\bar{\ell}^z)$, where $\bar{\ell}$ is the average minimum distance between all possible pairs of nodes in the network, $N$ is the number of nodes, $\gamma$ is the degree exponent of the SFN and $t$ is the step number of RWs. Especially, $\left$ in the limit $t \to \infty$ satisfies the relation $\left< R_{ee} \right> \sim \bar{\ell}^\alpha \sim d^\alpha$, where $d$ is the diameter of network with $d ({\bar \ell}) \simeq \ln N$ for $\gamma \ge 3$ or $d ({\bar \ell}) \simeq \ln \ln N$ for $\gamma < 3$. Based on the scaling relation $\left< R_{ee} \right>$, we also find that the scaling behavior of the diameter of networks can be measured very efficiently by using RWs.

Affiliated with

Also associated with

No associations

Rating

Random walks and diameter of finite scale-free networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Random walks and diameter of finite scale-free networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Random walks and diameter of finite scale-free networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-309827