Get started
This NetLogo algorithm simulates network formation using preferential attachment. New nodes are more likely to connect to existing nodes with higher degrees, reflecting a "lottery" system where popular nodes attract more links.
This model is an algorithm implemented in NetLogo.
Users can choose how many (unattached) nodes to begin the algorithm with.
Node size is proportional to the number of links the node has.
Name | Type | Description |
---|---|---|
initial-number-nodes | integer | the number of unconnected nodes existing before preferential attachment is applied. |
Name | Type | Description |
---|---|---|
network | object (agent and link sets) | nodes (turtles, breed nodes) and edges (links) between nodes, formed with iterations of preferential attachment. |