谢尔宾斯基三角
师(数学)
俘获
平面(几何)
传输(电信)
度量(数据仓库)
数学
拓扑(电路)
统计物理学
计算机科学
数学分析
组合数学
物理
分形
电信
几何学
数据挖掘
算术
生物
生态学
出处
期刊:Physica Scripta
[IOP Publishing]
日期:2024-02-07
卷期号:99 (4): 045222-045222
被引量:1
标识
DOI:10.1088/1402-4896/ad2751
摘要
Abstract An important characteristic of random wandering is the average trapping time, which is a hot issue in current research. The average trapping time is an important measure of the transmission efficiency of random wandering in a network. In this paper, we construct a 3-dimensional 3-level Sierpinski gasket network divided horizontally by the horizontal division plane P s , that is, the division coefficients s . We study the capture problem on the network and obtain an analytical expression for the average trapping time ( ATT ). Then, by adjusting the number of iterations and the values of the division coefficients, we obtained the relationship between ATT and them. As can be seen from our numerical simulation plots, ATT is affected by s . The larger s is, the more the self-similar structure of the three-dimensional residual network gradually transforms towards the structure of the two-dimensional complete Sierpinski gasket network. Meanwhile, the shorter ATT is, that is, the more efficient the transmission on the network.
科研通智能强力驱动
Strongly Powered by AbleSci AI