Ground State Structure in a Highly Disordered Spin Glass Model

Nonlinear Sciences – Adaptation and Self-Organizing Systems

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

LaTex file

Scientific paper

10.1007/BF02179805

We propose a new Ising spin glass model on $Z^d$ of Edwards-Anderson type, but with highly disordered coupling magnitudes, in which a greedy algorithm for producing ground states is exact. We find that the procedure for determining (infinite volume) ground states for this model can be related to invasion percolation with the number of ground states identified as $2^{\cal N}$, where ${\cal N} = {\cal N}(d)$ is the number of distinct global components in the ``invasion forest''. We prove that ${\cal N}(d) = \infty$ if the invasion connectivity function is square summable. We argue that the critical dimension separating ${\cal N} = 1$ and ${\cal N} = \infty$ is $d_c = 8$. When ${\cal N}(d) = \infty$, we consider free or periodic boundary conditions on cubes of side length $L$ and show that frustration leads to chaotic $L$ dependence with {\it all} pairs of ground states occuring as subsequence limits. We briefly discuss applications of our results to random walk problems on rugged landscapes.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Ground State Structure in a Highly Disordered Spin Glass Model 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 Ground State Structure in a Highly Disordered Spin Glass Model, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Ground State Structure in a Highly Disordered Spin Glass Model will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-300599

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.