Diffusion in heterogeneous networks

Bootstrap Percolation;Computer Simulation;Diffusion;Random graphs;Adjacency matrix;Heterogeneous;adoption;innovations;Game theory;threshold;connectivity

Dominguez Sagarena, Francisco J. ; Baryshnikov ; Yuliy

关键词: Bootstrap Percolation;    Computer Simulation;    Diffusion;    Random graphs;    Adjacency matrix;    Heterogeneous;    adoption;    innovations;    Game theory;    threshold;    connectivity;   

Others  :  https://www.ideals.illinois.edu/bitstream/handle/2142/87981/DOMINGUEZSAGARENA-THESIS-2015.pdf?sequence=1&isAllowed=y

美国|英语

来源: The Illinois Digital Environment for Access to Learning and Scholarship

【 摘 要 】

We create a program to simulate diffusion in random graphs. Specifically,we create a generalization of bootstrap percolation which incorporates any number of societies and an arbitrary weight matrix W. The code was created from the start to be as general as possible and to easily be modified with further complications. With it we simulate and analyze diffusion in networks consisting of one, two and three distinct societies with different parameters. We study the proportion of adoption as a function of threshold , probability of initial activity and connectivity Pc. We compare several different weight matrices in the two and three society cases to understand the effect of these changes on the diffusion process. The end result is a tool that we propose can be used with the aid of statistics in social or biologicalcontexts to predict behaviors and make conjectures on scenarios not yet observed.