The Laplacian spectrum and average trapping time for weighted Dyson hierarchical network

In this paper, we consider the weighted Dyson hierarchical network, that is a weighted fully-connected network, where the pattern of weights is ruled by a weight factor. Given that the Laplacian operator is intrinsically implied in the analysis of dynamic processes occurring on complex networks, Laplacian spectrum allows addressing analytically a large class of problems. Exploiting the deterministic recursive structure, we are able to derive explicitly all eigenvalues and their corresponding eigenvectors of Laplacian matrix. Further, we derive exact solutions of the trapping time (TT) and average trapping time (ATT) on the weighted Dyson hierarchical network with weight-dependent walk. The obtained results show that TT and ATT are related to the weight factor of the weighted Dyson hierarchical network.