Figure 1
From: Decentralized dynamic understanding of hidden relations in complex networks
Thieves in action. Snapshots with the illustration of GOT behavior over epochs on a simple unweighted network with 10 nodes. Initially, we set \({{\rm{\Phi }}}_{0}^{n}\mathrm{=10}\) vdiamonds and one thief per node, and we let the game to run for 1000 epochs. The colormap gives the number of vdiamonds, \({{\rm{\Phi }}}_{e}^{n}\), in any node (n) at epoch (e). The numbers on the side of each node show the rank of importance, Λe,n, assigned by GOT to the specific node (n) after (e) epochs, where e = 1, 2, 3, 4, 5, 100, 500, and 1000 epochs in subplots a,b,c,d,e,f,g, and h respectively.
