Analysis of integrity and segregation seeking models with a product adoption application

Official URL: http://risc01.sabanciuniv.edu/record=b1817031 (Table of Contents)

In this thesis, we study a kind of Ising-Schelling model with different lower and upper bound thresholds limits. The model consists of a regular lattice network with agents on it. Additionally, periodic boundary conditions are hold for the model. An agent is classified as unhappy if the proportion of the total number of neighbors which are the same type as this agent over the total number of neighbors is not greater than or equal to the lower bound of the agent. Then these unhappy agents start to convert themselves to other type. The algorithm works until there is no unhappy agent left in the network. The model is analyzed with different initial configurations, lower and upper bounds and the size of monochromatic clusters is studied. Our simulation results suggest that it is possible to reach ground state by manipulating initial numbers of different agent types and also with assigning different lower bounds for different agent types. The results also say that the size of monochromatic regions is independent of network size but highly depends on the lower bound and neighborhood radius. Furthermore, the models with upper bounds end up with interesting combined lines. Therefore, we named them as maze states and under different configurations, the appearances and distortion of these kind of shapes has been analyzed. Finally, we also implement a marketing application model about new product adoption behavior of customers. Our simulation results suggest that the chance of new product to survive in the community highly depends on the lower bound preferences of the individuals.