Learning from neighbours
vendredi 7 mai 2010, 14h30 - 15h30
Consider a discrete time interacting particle system on the
integer line where particles are of two types– red and blue.
At each instance a particle tosses a coin and based on the
success/failure of its own coin, as well as the colours and tosses of
the neighbouring coins it decides whether to retain its colour or
change to the other colour. We study the limiting behaviour of the
resultant Markov chain. This model has been studied by economists to
model diffusion of technologies.