Random & Distributed Graphs

Follow along with the course eBook: https://systemsinnovation.io/books/ Take the full course: https://systemsinnovation.io/courses/ Twitter: http://bit.ly/2JuNmXX LinkedIn: http://bit.ly/2YCP2U6 In this module, we talked about random graphs more formally termed the Erdős–Rényi random graph, where connections between nodes are placed at random with a given probability for their concurrence Transcription: When presenting the different classes of networks, people often start by presenting the random model to a network first, not because most networks in our world are random, quite the contrary, but it is by first understanding what a network create without any specific rules looks like that we can then compare the other networks we encounter around as to see if they differ from this and if they do then we can ask about the rules that created them. A random network is more formally termed the Erdős–Rényi random graph model, so named after two mathematicians who first introduced a set