期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Research on the Eigentime and Related Problems of theCorresponding Fractal Network of Sierpiński Fractal Antenna
1
作者 PENG Yulu HUANG Yuke 《中国应用数学通报》 2025年第2期10-18,共9页
This paper studies the eigentime and related issues in the fractal network corresponding to the Sierpiński fractal antenna.The access time or hitting time H(i,j)is the expected number of steps before node j is visite... This paper studies the eigentime and related issues in the fractal network corresponding to the Sierpiński fractal antenna.The access time or hitting time H(i,j)is the expected number of steps before node j is visited,starting from node i.The eigentime of G is the expectation of H(i,j)for all i,j∈G.Classical eigenvalue method let H(i,i)=0.However,when studying the random walk behavior of electrons in fractal networks corresponding to fractal antennas,it is nec-essary to consider the time when electrons leave a certain node and first return to that node(self return time).This paper adopts two research methods-the eigenvalue method based on spectral theory and the Markov chain method based on stochastic process theory-to obtain the modified in-trinsic time,and demonstrates through an example that the difference between the classical intrin-sic time and the modified intrinsic time is precisely due to the self return time.This paper shows the applications of fractal networks in modern communications.The research results are expected to provide a theoretical basis for the design and performance optimization of fractal antennas. 展开更多
关键词 Sierpiński fractal antenna fractal network random walk eigentime Markov Chain
在线阅读 下载PDF
Applications of Markov spectra for the weighted partition network by the substitution rule
2
作者 Mei-Feng Dai Ting-Ting Ju +3 位作者 Yong-Bo Hou Fang Huang Dong-Lei Tang Wei-Yi Su 《Communications in Theoretical Physics》 SCIE CAS CSCD 2020年第5期105-112,共8页
The weighted self-similar network is introduced in an iterative way.In order to understand the topological properties of the self-similar network,we have done a lot of research in this field.Firstly,according to the s... The weighted self-similar network is introduced in an iterative way.In order to understand the topological properties of the self-similar network,we have done a lot of research in this field.Firstly,according to the symmetry feature of the self-similar network,we deduce the recursive relationship of its eigenvalues at two successive generations of the transition-weighted matrix.Then,we obtain eigenvalues of the Laplacian matrix from these two successive generations.Finally,we calculate an accurate expression for the eigentime identity and Kirchhoff index from the spectrum of the Laplacian matrix. 展开更多
关键词 weighted self-similar network Laplacian matrix eigentime identity Kirchhoff index substitution rule
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部