Mathematics – Optimization and Control
Scientific paper
2010-01-22
Mathematics
Optimization and Control
11 pages, 4 figures, to be presented at IW-SMI2010, Kyoto, March 7-10, 2010
Scientific paper
A methodology to analyze the properties of the first (largest) eigenvalue and its eigenvector is developed for large symmetric random sparse matrices utilizing the cavity method of statistical mechanics. Under a tree approximation, which is plausible for infinitely large systems, in conjunction with the introduction of a Lagrange multiplier for constraining the length of the eigenvector, the eigenvalue problem is reduced to a bunch of optimization problems of a quadratic function of a single variable, and the coefficients of the first and the second order terms of the functions act as cavity fields that are handled in cavity analysis. We show that the first eigenvalue is determined in such a way that the distribution of the cavity fields has a finite value for the second order moment with respect to the cavity fields of the first order coefficient. The validity and utility of the developed methodology are examined by applying it to two analytically solvable and one simple but non-trivial examples in conjunction with numerical justification.
Kabashima Yoshiyuki
Takahashi Hisanao
Watanabe Osamu
No associations
LandOfFree
Cavity approach to the first eigenvalue problem in a family of symmetric random sparse matrices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Cavity approach to the first eigenvalue problem in a family of symmetric random sparse matrices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cavity approach to the first eigenvalue problem in a family of symmetric random sparse matrices will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-655380