Volatilities analysis of first-passage time and first-return time on a small-world scale-free network

Abstract

In this paper, we study random walks on a small-world scale-free network, also called as pseudofractal scale-free web (PSFW), and analyze the volatilities of first passage time (FPT) and first return time (FRT) by using the variance and the reduced moment as the measures. Note that the FRT and FPT are deeply affected by the starting or target site. We don't intend to enumerate all the possible cases and analyze them. We only study the volatilities of FRT for a given hub (i.e., node with highest degree) and the volatilities of the global FPT (GFPT) to a given hub, which is the average of the FPTs for arriving at a given hub from any possible starting site selected randomly according to the equilibrium distribution of the Markov chain. Firstly, we calculate exactly the probability generating function of the GFPT and FRT based on the self-similar structure of the PSFW. Then, we calculate the probability distribution, the mean, the variance and reduced moment of the GFPT and FRT by using the generating functions as a tool. Results show that: the reduced moment of FRT grows with the increasing of the network order $N$ and tends to infinity while $N\to \infty$; but for the reduced moments of GFPT, it is almost a constant($\approx 1.1605$) for large $N$. Therefore, on the PSFW of large size, the FRT has huge fluctuations and the estimate provided by MFRT is unreliable, whereas the fluctuations of the GFPT is much smaller and the estimate provided by its mean is more reliable. The method we propose can also be used to analyze the volatilities of FPT and FRT on other networks with self-similar structure, such as $(u,v)$ flowers and recursive scale-free trees.

2 figure, 18 pages, to be appear in JSTAT

References in corpus (19)

• First-passage times in complex scale-invariant media
• Diffusion, subdiffusion, and trapping of active particles in heterogeneous media
• Fractal and Transfractal Recursive Scale-Free Nets
• Exact mean first-passage time on the T-graph
• Exact solution for mean first-passage time on a pseudofractal scale-free web
• Return interval distribution of extreme events and long term memory
• Enumeration of spanning trees in a pseudofractal scale-free web
• Random walks on the Apollonian network with a single trap
• Trapping in dendrimers and regular hyperbranched polymers
• Evolving small-world scale-free networks consist of cliques
• Mean first-passage time for random walks on the T-graph
• Optimal and suboptimal networks for efficient navigation measured by mean-first passage time of random walks
• Impact of degree heterogeneity on the behavior of trapping in Koch networks
• Hitting and Trapping Times on Branched Structures
• Efficiency analysis of diffusion on T-fractals in the sense of random walks
• Scaling of mean first-passage time as efficiency measure of nodes sending information on scale-free Koch networks
• Analysis of diffusion and trapping efficiency for random walks on non-fractal scale-free trees
• Scaling and memory in the return intervals of energy dissipation rate in three-dimensional fully developed turbulence
• Random Walks on Complex Networks