Scaling properties of first-passage quantities on the fractal and transfractal scale free networks
Junhao Peng

TL;DR
This paper analyzes the scaling behavior of first-passage times on fractal and transfractal scale-free networks, deriving exact formulas and revealing how these quantities scale with network size and spectral properties.
Contribution
It introduces a method to exactly compute the probability generating function, mean, and variance of first-passage times on $(u,v)$ scale-free networks, including the novel transspectral dimension.
Findings
Mean GFPT scales as N_t^{2/d_s} for fractal networks.
Mean GFPT scales as N_t^{2/tilde{d}_s} for non-fractal networks.
Variance of GFPT scales quadratically with its mean.
Abstract
In this paper, we consider the random walk process on a kind of fractal (or transfractal) scale free networks, which also called as flowers, and we focus on the global first passage time (GFPT) and first return time (FRT). Here, we present method to derive exactly the probability generation function, mean and variance of the GFPT and FRT for a given hub (i.e., node with the highest degree) and then the scaling properties of the mean and the variance of the GFPT and FRT are disclosed. Our results show that, for the case of , while the networks are fractals, the mean of the GFPT scales with the volume of the network as , where denotes the mean of random variable , is the volume of the network with generation and is the spectral dimension of the network; but, for the case of , while the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplex Network Analysis Techniques · Stochastic processes and statistical mechanics · Complex Systems and Time Series Analysis
