Analysis of diffusion and trapping efficiency for random walks on non-fractal scale-free trees

DOI10.1016/J.PHYSA.2014.04.017zbMATH Open1395.60112arXiv1312.7038OpenAlexW2065804807MaRDI QIDQ1782887FDOQ1782887

Authors: Junhao Peng, Jian Xiong, Guo-Ai Xu 

Publication date: 20 September 2018

Published in: Physica A (Search for Journal in Brave)

Abstract: We study discrete random walks on the NFSFT and provide new methods to calculate the analytic solutions of the MFPT for any pair of nodes, the MTT for any target node and MDT for any source node. Further more, using the MTT and the MDT as the measures of trapping efficiency and diffusion efficiency respectively, we compare the trapping efficiency and diffusion efficiency for any two nodes of NFSFT and find the best (or worst) trapping sites and the best (or worst) diffusion sites. Our results show that: the two hubs of NFSFT is the best trapping site, but it is also the worst diffusion site, the nodes which are the farthest nodes from the two hubs are the worst trapping sites, but they are also the best diffusion sites. Comparing the maximum and minimum of MTT and MDT, we found that the ratio between the maximum and minimum of MTT grows logarithmically with network order, but the ratio between the maximum and minimum of MTT is almost equal to $1$. These results implie that the trap's position has great effect on the trapping efficiency, but the position of source node almost has no effect on diffusion efficiency. We also conducted numerical simulation to test the results we have derived, the results we derived are consistent with those obtained by numerical simulation.

Full work available at URL: https://arxiv.org/abs/1312.7038

Recommendations

• Effects of node position on diffusion and trapping efficiency for random walks on fractal scale-free trees
• Trapping efficiency of random walks on weighted scale-free trees
• RANDOM WALKS WITH A TRAP IN SCALE-FREE FRACTAL HIERARCHICAL LATTICES
• Random walks and percolation on trees
• scientific article; zbMATH DE number 4007385
• scientific article; zbMATH DE number 66573
• Random walks, capacity and percolation on trees

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Cites Work

• Emergence of Scaling in Random Networks
• Diffusion and reactions in fractals and disordered systems
• Collective dynamics of `small-world' networks
• First passage time statistics of Brownian motion with purely time dependent drift and diffusion
• Random walks and the effective resistance of networks
• Random Walks on Lattices. III. Calculation of First-Passage Times with Application to Exciton Trapping on Photosynthetic Units
• Random walks on dual Sierpinski gaskets
• Effect of trap position on the efficiency of trapping in treelike scale-free networks
• Singular dynamical renormalization group and biased diffusion on fractals

Cited In (15)

• Efficiency of long-range navigation on treelike fractals
• Calculations of first passage time of delayed tree-like networks
• RANDOM WALKS WITH A TRAP IN SCALE-FREE FRACTAL HIERARCHICAL LATTICES
• On the Hosoya index of a family of deterministic recursive trees
• Uncovering the impact of delay phenomenon on random walks in a family of weighted \(m\)-triangulation networks
• Trapping on modular scale-free and small-world networks with multiple hubs
• Volatilities analysis of first-passage time and first-return time on a small-world scale-free network
• Trapping efficiency of random walks on weighted scale-free trees
• Mean first passage time for random walk on dual structure of dendrimer
• Controlling the trapping efficiency in a family of scale-free tree networks
• Nonlinear diffusion through large complex networks containing regular subgraphs
• Mean trapping time for an arbitrary node on regular hyperbranched polymers
• Exact calculations of first-passage properties on the pseudofractal scale-free web
• Effects of node position on diffusion and trapping efficiency for random walks on fractal scale-free trees
• Exact calculations of first-passage quantities on a class of weighted tree-like fractal networks

This page was built for publication: Analysis of diffusion and trapping efficiency for random walks on non-fractal scale-free trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1782887)