Final year PhD candidate in Singapore, research in algorithmic game theory and large systems with a data-driven approach.

Erdos-Renyi is the first model of random graphs developed (1959). To form a network, we look at *n* nodes and for each pair of nodes, we "flip a coin" with probability *p*. That is, the coin gives Heads with probability *p* and Tails with probability *1-p*. If we obtain Heads, we connect the two nodes together.