Effective target arrangement in a deterministic scale-free graph

Abstract

We study the random walk problem on a deterministic scale-free network, in the presence of a set of static, identical targets; due to the strong inhomogeneity of the underlying structure the mean first-passage time (MFPT), meant as a measure of transport efficiency, is expected to depend sensitively on the position of targets. We consider several spatial arrangements for targets and we calculate, mainly rigorously, the related MFPT, where the average is taken over all possible starting points and over all possible paths. For all the cases studied, the MFPT asymptotically scales like N^{theta}, being N the volume of the substrate and theta ranging from (1 - log 2/log3), for central target(s), to 1, for a single peripheral target.

8 pages, 5 figures

References in corpus (10)

• First-passage times in complex scale-invariant media
• Global mean first-passage times of random walks on complex networks
• Exact mean first-passage time on the T-graph
• Exact solution for mean first-passage time on a pseudofractal scale-free web
• Random Walks on deterministic Scale-Free networks: Exact results
• Trapping in scale-free networks with hierarchical organization of modularity
• Average distance in a hierarchical scale-free network: an exact solution
• Trapping time statistics and efficiency of transport of optical excitations in dendrimers
• Autocatalytic reaction on low-dimensional substrates
• Inverted regions induced by geometric constraints on a classical encounter-controlled binary reaction

Cited by in corpus (27)

• Random walks on weighted networks
• Exact calculations of first-passage quantities on recursive networks
• Random walks in weighted networks with a perfect trap: An application of Laplacian spectra
• Mean first-passage time for random walks on undirected networks
• Trapping in dendrimers and regular hyperbranched polymers
• Influence of trap location on the efficiency of trapping in dendrimers and regular hyperbranched polymers
• Random walks in modular scale-free networks with multiple traps
• Exact calculations of first-passage properties on the pseudofractal scale-free web
• Mean first-passage time for maximal-entropy random walks in complex networks
• Optimal and suboptimal networks for efficient navigation measured by mean-first passage time of random walks
• Role of fractal dimension in random walks on scale-free networks
• Mean first-passage time for random walks in general graphs with a deep trap
• Controlling the efficiency of trapping in treelike fractals
• Scaling of mean first-passage time as efficiency measure of nodes sending information on scale-free Koch networks
• 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
• Maximal entropy random walk improves efficiency of trapping in dendrimers
• Mixed random walks with a trap in scale-free networks including nearest-neighbor and next-nearest-neighbor jumps
• Multitarget search on complex networks: A logarithmic growth of global mean random cover time
• Fast rare events in exit times distributions of jump processes
• Mean trapping time for an arbitrary node on regular hyperbranched polymers
• Random walks in unweighted and weighted modular scale-free networks with a perfect trap
• Optimal scale-free network with a minimum scaling of transport efficiency for random walks with a perfect trap
• Anomalous behavior of trapping in extended dendrimers with a perfect trap
• Effects of node position on diffusion and trapping efficiency for random walks on fractal scale-free trees
• Volatilities analysis of first-passage time and first-return time on a small-world scale-free network
• Heterogeneous Mean First-Passage Time Scaling in Fractal Media