100 citations · 733 across the 19 of their papers we have counts for
19 papers
Non-Backtracking Centrality Based Random Walk on Networks
Yuan Lin, Zhongzhi Zhang
Random walks are a fundamental tool for analyzing realistic complex networked systems and implementing randomized algorithms to solve diverse problems such as searching and samplin…
Assessing Percolation Threshold Based on High-Order Non-Backtracking Matrices
Yuan Lin, Wei Chen, Zhongzhi Zhang
Percolation threshold of a network is the critical value such that when nodes or edges are randomly selected with probability below the value, the network is fragmented but when th…
Dynamics of "comb-of-comb" networks
Hongxiao Liu, Yuan Lin, Maxim Dolgushev +1
The dynamics of complex networks, being a current hot topic of many scientific fields, is often coded through the corresponding Laplacian matrix. The spectrum of this matrix carrie…
Mean first-passage time for maximal-entropy random walks in complex networks
Yuan Lin, Zhongzhi Zhang
We perform an in-depth study for mean first-passage time (MFPT)---a primary quantity for random walks with numerous applications---of maximal-entropy random walks (MERW) performed…
Random walks in weighted networks with a perfect trap: An application of Laplacian spectra
Yuan Lin, Zhongzhi Zhang
In this paper, we propose a general framework for the trapping problem on a weighted network with a perfect trap fixed at an arbitrary node. By utilizing the spectral graph theory,…
Influence of trap location on the efficiency of trapping in dendrimers and regular hyperbranched polymers
Yuan Lin, Zhongzhi Zhang
In this paper, we study the trapping problem in two representative polymer networks, Cayley trees and Vicsek fractals, which separately model dendrimers and regular hyperbranched p…