Randomness and Complexity in Networks
published: Dec. 14, 2007, recorded: October 2007, views: 106
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
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.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !