Exactly solvable models of adaptive networks

Details Exactly solvable models of adaptive networks Exactly solvable models of adaptive networks

2006-06-29

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

Phys. Rev. Lett. 97, 148701 (2006)

Physics

Condensed Matter

Disordered Systems and Neural Networks

4 pages, 4 figures

Scientific paper

10.1103/PhysRevLett.97.148701

A satisfiability (SAT-UNSAT) transition takes place for many optimization problems when the number of constraints, graphically represented by links between variables nodes, is brought above some threshold. If the network of constraints is allowed to adapt by redistributing its links, the SAT-UNSAT transition may be delayed and preceded by an intermediate phase where the structure self-organizes to satisfy the constraints. We present an analytic approach, based on the recently introduced cavity method for large deviations, which exactly describes the two phase transitions delimiting this adaptive intermediate phase. We give explicit results for random bond models subject to the connectivity or rigidity percolation transitions, and compare them with numerical simulations.

Affiliated with

Also associated with

No associations

Rating

Exactly solvable models of adaptive networks 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 Exactly solvable models of adaptive networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Exactly solvable models of adaptive networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-597714