Mean-field behavior of the negative-weight percolation model on random regular graphs

Details Mean-field behavior of the negative-weight percolation model on random regular graphs Mean-field behavior of the negative-weight percolation model on random regular graphs

2011-07-08

arxiv.org/abs/1107.1742v1

Physics

Condensed Matter

Disordered Systems and Neural Networks

11 pages, 10 figures, paper summary available at http://www.papercore.org/Melchert2011

Scientific paper

We investigate both analytically and numerically the ensemble of minimum-weight loops and paths in the negative-weight percolation model on random graphs with fixed connectivity and bimodal weight distribution. This allows us to study the mean-field behavior of this model. The analytical study is based on a conjectured equivalence with the problem of self-avoiding walks in a random medium. The numerical study is based on a mapping to a standard minimum-weight matching problem for which fast algorithms exist. Both approaches yield results which are in agreement, on the location of the phase transition, on the value of critical exponents, and on the absence of any sizeable indications of a glass phase. By these results, the previously conjectured upper critical dimension of d_u=6 is confirmed.

Affiliated with

Also associated with

No associations

Rating

Mean-field behavior of the negative-weight percolation model on random regular graphs 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 Mean-field behavior of the negative-weight percolation model on random regular graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Mean-field behavior of the negative-weight percolation model on random regular graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-674751