![]() WIRE1: Each turtle asks one other turtle to link to it. There are four different wiring methods illustrated: SETUP creates NUM-NODES turtles and gives them a random location in the world. This model shows four different ways to create random networks, 2 of which create the variants of the classic Erdős–Rényi networks. The most well known are two variants called Erdős–Rényi networks. ![]() There are several different models for random networks. The theory of random networks was first introduced by mathematicians Paul Erdős and Alfréd Rényi in 1959. The model, as well as any updates to the model, can also be found on the textbook website. This model is in the IABM Textbook folder of the NetLogo Models Library. Introduction to Agent-Based Modeling: Modeling Natural, Social and Engineered Complex Systems with NetLogo. This model is from Chapter Five of the book "Introduction to Agent-Based Modeling: Modeling Natural, Social and Engineered Complex Systems with NetLogo", by Uri Wilensky & William Rand. You can also Try running it in NetLogo Web If you download the NetLogo application, this model is included. This work is licensed under a Creative Commons Attribution 3.Beginners Interactive NetLogo Dictionary (BIND) Game strategies and different topologies (NetLogo)įind your way around on Kleinberg's small world lattice Play the iterated prisoners'' dilemma game on different topologies (model created by Ed Baskerville): Graph coloring in a small world topology (NetLogo) Each nodes tries to pick a different color than each of its neighbors. ![]() Play a game of coordination on a small world topology. Percolation on a square lattice (NetLogo) Is there a critical threshold for the percentage of active nodes at which the lattice percolates (i.e. Testing the resilience of a Gnutella network (Guess) See how the Gnutella peer-to-peer filesharing network holds up to random node failure and targeted attack on the highest degree nodes. This demo was written by Patrick Jordan based on the algorithm by Gunes Erkan and Dragomir Radev: Use LexRank, a PageRank based algorithm, to summarize text. Experiment by varying the teleportation probability in applying PageRank to a small network. Having high PageRank means that not only do others link to you, but those others are themselves linked to. Choose nodes in a small social network such that your opinion wins out. This model is set up as a two-player game. Sometimes whether an opinion diffuses or not depends on the initial location where it is formed, and also whether one is dealing with simple contagion (each of your friends "infects" you with constant probability at each time point) or complex contagion (you need to hear it from at least two friends to adopt an opinion). See how the tendency of new nodes to attach to well connected nodes influences the rate of spread:ĭiffusion in randomly and preferentially grown networks (NetLogo)įind out how random rewiring affects the probability that an infection persists in the network using an SIS (susceptible-infected-susceptible) model. Next, take a growing network, with and without preferential attachment. Start with a simple Erdos-Renyi random graph, and figure out how the density of the network affects the speed of diffusion.ĭiffusion in an Erdos Renyi graph (NetLogo) Opinion formation on a toy network (NetLogo) Use the Girvan-Newman betweenness clustering algorithm to discover community structure in the linking patterns of political blogs.įind out how community structure can affect opinion formation. Random and preferential attachment NetLogo model Vary this preference and see the effect on the growing network. It can do this purely at random, or it may prefer nodes who have more connections. Giant Component Model (model is part of the standard NetLogo models library)Įach node that joins the network has to decide what other node(s) it will attach to. Is there a critical average degree at which a giant component emerges? Vary the average degree in the classic Erdos-Renyi random graph model. See how different amounts of random rewiring affect the shortest path and clustering coefficient of the network: NetLearn: Interactive demonstrations of network conceptsĮxperiment with the Watts-Strogatz small world model.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |