Material Detail

Randomness and Complexity in Networks

Randomness and Complexity in Networks

This video was recorded at 4th European Conference on Complex Systems. Recently we showed that a simple model of network rewiring could besolved exactly for any time and any parameter value. We also showed that this model can be recast in terms of several well known models of statistical physics such as urn model and the voter model. We also noted that it has been applied to a wide range of problems. Here we consider various generalisations of this model and includesome new exact results.
Rate

Quality

  • User Rating
  • Comments
  • Learning Exercises
  • Bookmark Collections
  • Course ePortfolios
  • Accessibility Info

More about this material

Comments

Log in to participate in the discussions or sign up if you are not already a MERLOT member.