{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/87981"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/87981","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Diffusion in heterogeneous networks","abstract":"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 biological contexts to predict behaviors and make conjectures on scenarios not yet observed.","abstract_html":"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 biological contexts to predict behaviors and make conjectures on scenarios not yet observed.","abstract_has_math":false,"creators":["Dominguez Sagarena, Francisco J."],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Electrical & Computer Engineering","degree_department":null,"school":null,"contributors":["Baryshnikov, Yuliy"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-09-29T20:37:51Z","date_published":"2015-09-29T20:37:51Z","updated_at":"2026-07-22T22:26:31Z","subjects":["Bootstrap Percolation","Computer Simulation","Diffusion","Random graphs","Adjacency matrix","Heterogeneous","adoption","innovations","Game theory","threshold","connectivity"],"languages":["en"],"rights":["Copyright 2015 Francisco Dominguez Sagarena"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/87981","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Baryshnikov, Yuliy"]},{"key":"dc:creator","label":"Author","values":["Dominguez Sagarena, Francisco J."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2015-09-29T20:37:51Z","2015-08","2015-07-01","2015-8"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical & Computer Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Bootstrap Percolation","Computer Simulation","Diffusion","Random graphs","Adjacency matrix","Heterogeneous","adoption","innovations","Game theory","threshold","connectivity"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2015 Francisco Dominguez Sagarena"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/87981"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["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 biological contexts to predict behaviors and make conjectures on scenarios not yet observed.","Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2015-09-29 without embargo terms","The student, Francisco Dominguez Sagarena, accepted the attached license on 2015-06-29 at 10:36.","The student, Francisco Dominguez Sagarena, submitted this Thesis for approval on 2015-06-29 at 11:24.","This Thesis was approved for publication on 2015-07-01 at 10:55.","DSpace SAF Submission Ingestion Package generated from Vireo submission #8316 on 2015-09-29 at 13:21:40","Made available in DSpace on 2015-09-29T20:37:51Z (GMT). No. of bitstreams: 17 DOMINGUEZSAGARENA-THESIS-2015.pdf: 19861789 bytes, checksum: 21da54259f9b0cfdcd0aff48aa2124d3 (MD5) Critical_Test.m: 1186 bytes, checksum: f13378cc34d67bf142a4e5caeec6522f (MD5) Evolve_MPopulation.m: 6072 bytes, checksum: 70caa7e5b174066833c6d146e452e08c (MD5) Find_Perm_Data.m: 2315 bytes, checksum: c90d4e47c460ccc81606baf1fcf2649c (MD5) Graph2D.m: 4372 bytes, checksum: 1fca1e43a45f201764ce8ac8131cd5d2 (MD5) Graph3d.m: 5977 bytes, checksum: 5f98c652d811112f97db5047656a6b38 (MD5) Graph_User_Int.m: 21044 bytes, checksum: 6687d8b29dbfe8b66b7a0a902e7be7e9 (MD5) Init_Pop.m: 3701 bytes, checksum: 1d0161f58508b578d499a7ee086cda32 (MD5) Movievolution.m: 6602 bytes, checksum: 1af8d43879f82851a719acdbbedd9200 (MD5) Percolation.m: 5088 bytes, checksum: a09e757af91ee7b0fdac47f32996df0a (MD5) Reshape_Variable.m: 2612 bytes, checksum: 4e0a753316d32d69c026e58afc4209bc (MD5) Variation_MP.m: 5144 bytes, checksum: 4326e164821d47ef3acdbb033653c27d (MD5) Variation_Perm.m: 2225 bytes, checksum: b45ce933287fe71b4554c31bb65abdaa (MD5) Visualization.m: 2605 bytes, checksum: ecf9093fb05f18755385d7001b57d306 (MD5) ex_guide_timergui.m: 8944 bytes, checksum: dc94c5d7ae75caac75357216e8938ac5 (MD5) timebar.m: 8412 bytes, checksum: dd1f1f4a30ee2dde64ee2f43b8c1ef1a (MD5) LICENSE.txt: 4225 bytes, checksum: 0abed9e38103134181ee1b354deb29bf (MD5) Previous issue date: 2015-07-01"]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Diffusion in heterogeneous networks"]}]}],"canonical_facts":{"dc:contributor":["Baryshnikov, Yuliy"],"dc:creator":["Dominguez Sagarena, Francisco J."],"dc:date":["2015-09-29T20:37:51Z","2015-08","2015-07-01","2015-8"],"dc:description":["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 biological contexts to predict behaviors and make conjectures on scenarios not yet observed.","Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2015-09-29 without embargo terms","The student, Francisco Dominguez Sagarena, accepted the attached license on 2015-06-29 at 10:36.","The student, Francisco Dominguez Sagarena, submitted this Thesis for approval on 2015-06-29 at 11:24.","This Thesis was approved for publication on 2015-07-01 at 10:55.","DSpace SAF Submission Ingestion Package generated from Vireo submission #8316 on 2015-09-29 at 13:21:40","Made available in DSpace on 2015-09-29T20:37:51Z (GMT). No. of bitstreams: 17 DOMINGUEZSAGARENA-THESIS-2015.pdf: 19861789 bytes, checksum: 21da54259f9b0cfdcd0aff48aa2124d3 (MD5) Critical_Test.m: 1186 bytes, checksum: f13378cc34d67bf142a4e5caeec6522f (MD5) Evolve_MPopulation.m: 6072 bytes, checksum: 70caa7e5b174066833c6d146e452e08c (MD5) Find_Perm_Data.m: 2315 bytes, checksum: c90d4e47c460ccc81606baf1fcf2649c (MD5) Graph2D.m: 4372 bytes, checksum: 1fca1e43a45f201764ce8ac8131cd5d2 (MD5) Graph3d.m: 5977 bytes, checksum: 5f98c652d811112f97db5047656a6b38 (MD5) Graph_User_Int.m: 21044 bytes, checksum: 6687d8b29dbfe8b66b7a0a902e7be7e9 (MD5) Init_Pop.m: 3701 bytes, checksum: 1d0161f58508b578d499a7ee086cda32 (MD5) Movievolution.m: 6602 bytes, checksum: 1af8d43879f82851a719acdbbedd9200 (MD5) Percolation.m: 5088 bytes, checksum: a09e757af91ee7b0fdac47f32996df0a (MD5) Reshape_Variable.m: 2612 bytes, checksum: 4e0a753316d32d69c026e58afc4209bc (MD5) Variation_MP.m: 5144 bytes, checksum: 4326e164821d47ef3acdbb033653c27d (MD5) Variation_Perm.m: 2225 bytes, checksum: b45ce933287fe71b4554c31bb65abdaa (MD5) Visualization.m: 2605 bytes, checksum: ecf9093fb05f18755385d7001b57d306 (MD5) ex_guide_timergui.m: 8944 bytes, checksum: dc94c5d7ae75caac75357216e8938ac5 (MD5) timebar.m: 8412 bytes, checksum: dd1f1f4a30ee2dde64ee2f43b8c1ef1a (MD5) LICENSE.txt: 4225 bytes, checksum: 0abed9e38103134181ee1b354deb29bf (MD5) Previous issue date: 2015-07-01"],"dc:format":["application/pdf"],"dc:identifier":["http://hdl.handle.net/2142/87981"],"dc:language":["en"],"dc:rights":["Copyright 2015 Francisco Dominguez Sagarena"],"dc:subject":["Bootstrap Percolation","Computer Simulation","Diffusion","Random graphs","Adjacency matrix","Heterogeneous","adoption","innovations","Game theory","threshold","connectivity"],"dc:title":["Diffusion in heterogeneous networks"],"dc:type":["text"],"thesis:degree_discipline":["Electrical & Computer Engineering"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:31Z"}