Physics – Condensed Matter – Disordered Systems and Neural Networks
Scientific paper
2004-12-23
Phys. Rev. E 71, 016103 (2005)
Physics
Condensed Matter
Disordered Systems and Neural Networks
9 pages, 7 figures
Scientific paper
10.1103/PhysRevE.71.016103
Several kinds of walks on complex networks are currently used to analyze search and navigation in different systems. Many analytical and computational results are known for random walks on such networks. Self-avoiding walks (SAWs) are expected to be more suitable than unrestricted random walks to explore various kinds of real-life networks. Here we study long-range properties of random SAWs on scale-free networks, characterized by a degree distribution $P(k) \sim k^{-\gamma}$. In the limit of large networks (system size $N \to \infty$), the average number $s_n$ of SAWs starting from a generic site increases as $\mu^n$, with $\mu = < k^2 > / < k > - 1$. For finite $N$, $s_n$ is reduced due to the presence of loops in the network, which causes the emergence of attrition of the paths. For kinetic growth walks, the average maximum length, $< L >$, increases as a power of the system size: $< L > \sim N^{\alpha}$, with an exponent $\alpha$ increasing as the parameter $\gamma$ is raised. We discuss the dependence of $\alpha$ on the minimum allowed degree in the network. A similar power-law dependence is found for the mean self-intersection length of non-reversal random walks. Simulation results support our approximate analytical calculations.
No associations
LandOfFree
Self-avoiding walks on 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 Self-avoiding walks on scale-free networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Self-avoiding walks on scale-free networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-93728