.png){kind=icon}
Return
Average trapping time on a half 3-level nested network
.png){kind=icon}
PRE
AI
DOI：10.1088/1402-4896/adc046.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we focus on a half nested network (HSn degrees N), which is the left half of nested network (Sn degrees N) based on the vertical cutting of symmetry axis. We study the capture problem of unbiased random walk on HSn degrees N. Further, the change in diffusion efficiency between HSn degrees N and Sn degrees N is studied. According to the self-similarity of the network, the analytical expression of the average trapping time of HSn degrees N is obtained. In addition, we draw the relevant numerical simulation diagram. By comparing the growth trend of the two curves, we find that with the increase of the number of network iterations, the average trapping time of HSn degrees N does not change much compared with Sn degrees N. It indicates that the diffusion efficiency of the network after vertical cutting is not affected much at large scale.
Keywords:
average trapping time
self-similarity
random walk
vertical cutting
Journal
IF:
2.6
Papers:
4.3K
Citations:
2.5W
Organization
No organization information available
Cited Papers
Average trapping time on the weighted hierarchical triangle network with primary node iteration.png)
ScienceAsia
OAAI
ScienceAsiaIF0
OAAIShareSaveShareSaveContinuous-Time Quantum Walk in Glued Trees: Localized State-Mediated Almost Perfect Quantum-State TransferEntropyOAAI
EntropyIF0
OAAIShareSaveIdentifying influential nodes in social networks: Centripetal centrality and seed exclusion approach
OAAI
OAAIShareSaveShareSaveShareSaveShareSaveShareSave
View more