Analysis for Context Segregation. In these experiments, we look ad different segregation models where agents avoid neighborhoods under different circumstances. This is built on top of the Context Switching model where agents switch based on a probability.

Brief analysis of the properties of randomly overlapped networks.

We analyse the convergence and number of encounters for the model of context switching. In this model a group of agents tries to reach total consensus in a decentralised manner by using simple asynchronous pairwise interactions. The agents interact in different network structures but they are only active in one network at a time. To switch between the different networks we used a new parameter called switching probability. We analyse the influence of this parameter in the convergence to consensus.

We analyse the convergence and number of encounters for the model of context permeability. In this model a group of agents tries to reach total consensus in a decentralised manner by using simple asynchronous pairwise interactions. The agents interact in different network structures at the same time. Here, we use k-regular and scale-free networks.