Analysis of fluctuations in the first return times of random walks on regular branched networks

Abstract

The first return time (FRT) is the time it takes a random walker to first return to its original site, and the global first passage time (GFPT) is the first passage time for a random walker to move from a randomly selected site to a given site. We find that in finite networks the variance of FRT, Var(FRT), can be expressed Var(FRT)~$=2⟨$FRT$⟩⟨$GFPT$⟩-⟨$FRT${⟩}^2-⟨$FRT$⟩$, where $⟨\cdot ⟩$ is the mean of the random variable. Therefore a method of calculating the variance of FRT on general finite networks is presented. We then calculate Var(FRT) and analyze the fluctuation of FRT on regular branched networks (i.e., Cayley tree) by using Var(FRT) and its variant as the metric. We find that the results differ from those in such other networks as Sierpinski gaskets, Vicsek fractals, T-graphs, pseudofractal scale-free webs, ($u,v$) flowers, and fractal and non-fractal scale-free trees.

arXiv comment7 pages,1 figure

References in corpus (31)

• First-passage times in complex scale-invariant media
• Diffusion, subdiffusion, and trapping of active particles in heterogeneous media
• Global mean first-passage times of random walks on complex networks
• First passage time for random walks in heterogeneous networks
• Exact mean first-passage time on the T-graph
• Cayley Trees and Bethe Lattices, a concise analysis for mathematicians and physicists
• Exact solution for mean first-passage time on a pseudofractal scale-free web
• Return interval distribution of extreme events and long term memory
• Coherent exciton transport in dendrimers and continuous-time quantum walks
• Extreme events on complex networks
• Exact calculations of first-passage quantities on recursive networks
• Determining mean first-passage time on a class of treelike regular fractals
• Spectral dimensions of hierarchical scale-free networks with shortcuts
• Trapping in complex networks
• Trapping in dendrimers and regular hyperbranched polymers
• Return times of random walk on generalized random graphs
• Multifractal properties of return time statistics
• Influence of trap location on the efficiency of trapping in dendrimers and regular hyperbranched polymers
• Mean first-passage time for random walks on the T-graph
• Return probability: Exponential versus Gaussian decay
• Exact calculations of first-passage properties on the pseudofractal scale-free web
• Anomalous behavior of trapping on a fractal scale-free network
• Scaling laws for diffusion on (trans)fractal scale-free networks
• Extreme value statistics and return intervals in long-range correlated uniform deviates
• Return times for Stochastic processes with power-law scaling
• Efficiency analysis of diffusion on T-fractals in the sense of random walks
• Analysis of diffusion and trapping efficiency for random walks on non-fractal scale-free trees
• Return probabilities and hitting times of random walks on sparse Erdos-Renyi graphs
• Scaling and memory in the return intervals of energy dissipation rate in three-dimensional fully developed turbulence
• Mean trapping time for an arbitrary node on regular hyperbranched polymers
• Effects of node position on diffusion and trapping efficiency for random walks on fractal scale-free trees

Cited by in corpus (2)

• Exact results for the first-passage properties in a class of fractal networks
• First encounters on Bethe Lattices and Cayley Trees