Journal of Physics A: Mathematical and Theoretical


First eigenvalue/eigenvector in sparse random symmetric matrices: influences of degree fluctuation

Yoshiyuki Kabashima1 and Hisanao Takahashi2

Show affiliations

Paper

The properties of the first (largest) eigenvalue and its eigenvector (first eigenvector) are investigated for large sparse random symmetric matrices that are characterized by bimodal degree distributions. In principle, one should be able to accurately calculate them by solving a functional equation concerning auxiliary fields which come out in an analysis based on replica/cavity methods. However, the difficulty in analytically solving this equation makes an accurate calculation infeasible in practice. To overcome this problem, we develop approximation schemes on the basis of two exceptionally solvable examples. The schemes are reasonably consistent with numerical experiments when the statistical bias of positive matrix entries is sufficiently large, and they qualitatively explain why considerably large finite size effects of the first eigenvalue can be observed when the bias is relatively small.


PACS

02.10.Ud Linear algebra

02.30.Ks Delay and functional equations

02.10.Yn Matrix theory

MSC

15A52 Random matrices

39B32 Equations for complex functions (See also 30D05)

39B42 Matrix and operator equations (See also 47Jxx)

65Q05 Difference and functional equations, recurrence relations

Subjects

Mathematical physics

Dates

Issue 32 (17 August 2012)

Received 25 April 2012, in final form 2 July 2012

Published 24 July 2012

Metrics

Total article downloads: 193

More metrics

Permissions

Get permission to re-use this article



  1. First eigenvalue/eigenvector in sparse random symmetric matrices: influences of degree fluctuation

    Yoshiyuki Kabashima and Hisanao Takahashi 2012 J. Phys. A: Math. Theor. 45 325001

View by subject



Export