Tidy experiment with well distributed properties – 1
2018-10-03
1 Introduction
The goal was to procude data that would allow to compare the centralized and decentralized algorithms performance when the number of item nodes or number of similarity nodes increases. The problem is that number of nodes and links in the graph are obviously related – so they are not independent variables. Furthermore, number of links is not a direct parameter of the simulation. Rather similarity
links get created during a simulation and depend on similarityConnectThreshold
parameters which regulates how similar item values should be in order to be connected by an explicit link, and the item values are initialized randomly. In short, number of links is an emergent variable, therefore the following run was meant to try out several parameter values (based on the knowledge from previous experiments) in order to come up with graphs and link numbers that are comparable.
No. | expermentId | Comment |
---|---|---|
1 | EXP09-25-07-21-KtTayU | agentNumbers=[50, 100, 200, 400, 800] : chainLengths=[5, 10, 20] : randomWorksNumberMultipliers=[1, 2] : maxDistances=[5, 10, 30] : similaritySearchThresholds=[1] : similarityConnectThresholds=[0.9] : graphTypes=[random, smallWorld] ; Crashed somewhere on 400 agents in be start of randomWorksNumberMultiplier 2. |
2 | EXP09-30-10-25-HycEjd | agentNumbers=[400] : chainLengths=[5] : randomWorksNumberMultipliers=[2] : maxDistances=[5, 10, 30] : similaritySearchThresholds=[1] : similarityConnectThresholds=[0.9] : graphTypes=[random, smallWorld]; Rerunning from the place where crashed; |