Counting Stationary Points of Random Landscapes as a Random Matrix Problem

Details Counting Stationary Points of Random Landscapes as a Random Matrix Problem Counting Stationary Points of Random Landscapes as a Random Matrix Problem

2005-07-03

arxiv.org/abs/cond-mat/0507059v1

Acta Physica Polonica B, v.36 (2005), 2699-2707

Physics

Condensed Matter

Disordered Systems and Neural Networks

Presentation at "Applications of Random Matrices to Economy and Other Complex Systems", May 26-28, 2005, Krakow

Scientific paper

Finding the mean of the total number of stationary points for N-dimensional random Gaussian landscapes can be reduced to averaging the absolute value of characteristic polynomial of the corresponding Hessian. First such a reduction is illustrated for a class of models describing energy landscapes of elastic manifolds in random environment, and a general method of attacking the problem analytically is suggested. Then the exact solution to the problem [Phys. Rev. Lett. v.92 (2004) 240601] for a class of landscapes corresponding to the simplest, yet nontrivial "toy model" with N degrees of freedom is described. Asymptotic analysis reveals a phase transition to a glass-like state of the matter.

Affiliated with

Also associated with

No associations

Rating

Counting Stationary Points of Random Landscapes as a Random Matrix Problem 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 Counting Stationary Points of Random Landscapes as a Random Matrix Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Counting Stationary Points of Random Landscapes as a Random Matrix Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-209235