Barnabé Monnot

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

Publications

Posts

Teaching

News

CV

Barabasi-Albert generator

Barabasi-Albert networks are formed by creating an m-complete graph. After this first step, we add nodes one by one until we reach n nodes. Each node connects to m other nodes among those that are already present. The probability of connecting to a particular node is proportional to the degree of that node: well-connected nodes receive more connections, so nodes added earlier in the process tend to receive a lot of connections.