Edge-Reinforced Random Walks (IMAGE)

Queen Mary University of London

Edge-Reinforced Random Walks

Caption

Edge-reinforced random walks produce a co-evolution of the network with the dynamics of the walkers. At time t the walker is on the red node and has already visited the grey nodes, while the shaded nodes are still unexplored. The widths of edges are proportional to their weights. At time t + 1 the walker has moved to a neighboring node (red), and the weight of the used edge has been reinforced by δw. At this point, the walker will preferentially go back, although it can also access the set of 'adjacent possible' (green).

Credit

Iacopo Iacopini

Usage Restrictions

None

License

Licensed content

Disclaimer: AAAS and EurekAlert! are not responsible for the accuracy of news releases posted to EurekAlert! by contributing institutions or for the use of any information through the EurekAlert system.