86 citations · 526 across the 12 of their papers we have counts for
8 papers · 1 filter
Controlling the efficiency of trapping in treelike fractals
Bin Wu, Zhongzhi Zhang
Efficiently controlling the trapping process, especially the trapping efficiency, is central in the study of trap problem in complex systems, since it is a fundamental mechanism fo…
Counting spanning trees in a small-world Farey graph
Zhongzhi Zhang, Bin Wu, Yuan Lin
The problem of spanning trees is closely related to various interesting problems in the area of statistical physics, but determining the number of spanning trees in general network…
Complete spectrum of stochastic master equation for random walks on treelike fractals
Zhongzhi Zhang, Bin Wu, Guanrong Chen
We study random walks on a family of treelike regular fractals with a trap fixed on a central node. We obtain all the eigenvalues and their corresponding multiplicities for the ass…
Counting spanning trees in self-similar networks by evaluating determinants
Yuan Lin, Bin Wu, Zhongzhi Zhang +1
Spanning trees are relevant to various aspects of networks. Generally, the number of spanning trees in a network can be obtained by computing a related determinant of the Laplacian…
Determining mean first-passage time on a class of treelike regular fractals
Yuan Lin, Bin Wu, Zhongzhi Zhang
Relatively general techniques for computing mean first-passage time (MFPT) of random walks on networks with a specific property are very useful, since a universal method for calcul…
Enumeration of spanning trees in a pseudofractal scale-free web
Zhongzhi Zhang, Hongxiao Liu, Bin Wu +1
Spanning trees are an important quantity characterizing the reliability of a network, however, explicitly determining the number of spanning trees in networks is a theoretical chal…