Full eigenvalues of the Markov matrix for scale-free polymer networks

Zhongzhi Zhang, Xiaoye Guo, and Yuan Lin
Phys. Rev. E 90, 022816 – Published 26 August 2014

Abstract

Much important information about the structural and dynamical properties of complex systems can be extracted from the eigenvalues and eigenvectors of a Markov matrix associated with random walks performed on these systems, and spectral methods have become an indispensable tool in the complex system analysis. In this paper, we study the Markov matrix of a class of scale-free polymer networks. We present an exact analytical expression for all the eigenvalues and determine explicitly their multiplicities. We then use the obtained eigenvalues to derive an explicit formula for the random target access time for random walks on the studied networks. Furthermore, based on the link between the eigenvalues of the Markov matrix and the number of spanning trees, we confirm the validity of the obtained eigenvalues and their corresponding degeneracies.

  • Figure
  • Received 6 June 2014

DOI:https://doi.org/10.1103/PhysRevE.90.022816

©2014 American Physical Society

Authors & Affiliations

Zhongzhi Zhang*, Xiaoye Guo, and Yuan Lin

  • School of Computer Science and Shanghai Key Lab of Intelligent Information Processing, Fudan University, Shanghai 200433, China

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 90, Iss. 2 — August 2014

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review E

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×