title: Spectrum of walk matrix for Koch network and its application.
abstract: Various structural and dynamical properties of a network are encoded in the eigenvalues of walk matrix describing random walks on the network. In this paper, we study the spectra of walk matrix of the Koch network, which displays the prominent scale-free and small-world features. Utilizing the particular architecture of the network, we obtain all the eigenvalues and their corresponding multiplicities. Based on the link between the eigenvalues of walk matrix and random target access time defined as the expected time for a walker going from an arbitrary node to another one selected randomly according to the steady-state distribution, we then derive an explicit solution to the random target access time for random walks on the Koch network. Finally, we corroborate our computation for the eigenvalues by enumerating spanning trees in the Koch network, using the connection governing eigenvalues and spanning trees, where a spanning tree of a network is a subgraph of the network, that is, a tree containing all the nodes.
authors.affiliation: School of Computer Science, Fudan University, Shanghai 200433, China.
authors.forename: Pinchen
authors.initials: P
authors.lastname: Xie
authors.affiliation: School of Computer Science, Fudan University, Shanghai 200433, China.
authors.forename: Yuan
authors.initials: Y
authors.lastname: Lin
authors.affiliation: School of Computer Science, Fudan University, Shanghai 200433, China.
authors.forename: Zhongzhi
authors.initials: Z
authors.lastname: Zhang