Exact calculations of first-passage properties on the pseudofractal scale-free web
arXiv:1903.04777 · doi:10.1063/1.4927085
Abstract
In this paper, we consider discrete time random walks on the pseudofractal scale-free web (PSFW) and we study analytically the related first passage properties. First, we classify the nodes of the PSFW into different levels and propose a method to derive the generation function of the first passage probability from an arbitrary starting node to the absorbing domain, which is located at one or more nodes of low-level (i.e., nodes with large degree). Then, we calculate exactly the first passage probability, the survival probability, the mean and the variance of first passage time by using the generating functions as a tool. Finally, for some illustrative examples corresponding to given choices of starting node and absorbing domain, we derive exact and explicit results for such first passage properties. The method we propose can as well address the cases where the absorbing domain is located at one or more nodes of high-level on the PSFW, and it can also be used to calculate the first passage properties on other networks with self-similar structure, such as flowers and recursive scale-free trees.
12 pages, 4 figures
References in corpus (14)
- First-passage times in complex scale-invariant 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
- Determining mean first-passage time on a class of treelike regular fractals
- 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
- Trapping time statistics and efficiency of transport of optical excitations in dendrimers
- 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