Count turtles netlogo12/20/2023 ![]() RAND-ENCOUNTER places nodes randomly on a 2D square area. This means that some nodes end up with more neighbors, because they are the closest choice to some other node even though they already have plenty of closer neighbors. Each node tries to connect to its NUM-NEIGHBORS closest neighbors. Keep Layout? OFF so that node positions don’t change while network is being built. STATIC-GEO randomly places nodes on a 2-D square area. The rest of the time the nodes try to get one of their friends to introduce them to someone they know. INTRODUCTION similar to ERDÖS-RENYI, however, random edges are added only with probability (1 - PROB-INTRO). The following are the network construction algorithms:ĮRDÖS-RENYI constructs a random graph by adding an edge between each pair of nodes with probability PROB-LINK. The ASP monitor reports on the average shortest path between nodes in the largest connected component only. DEG monitor box reports on the average degree in the network. The GC SIZE monitor box updates with the size of the largest component. With the NUM-NODES slider you determine the number of nodes in the network. HOW TO USE ITĬlick on LAYOUT to use a spring layout algorithm to reposition the nodes (you will typically want to keep this off while applying the network construction algorithms). Then edges are added, but just how depends on the model you choose. HOW IT WORKSĪll except for the GROWTH model start with a fixed number of nodes (detemined by the NUM-NODES). meeting people through your friends (INTRODUCTION model), linking houses or cities with roads (STATIC GEO model), literally running into people and becoming friends (RAND ENCOUNTER model), and adding new nodes to the network (GROWTH). ![]() You can generate networks using several different models, starting with the Erdös-Renyi (the “randomest”) network model, and a few variations that might represent e.g. If you are downloading this model to use directly with the NetLogo desktop app, please also download the 'nw' extension.
0 Comments
Leave a Reply.AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |