Modelos de difusão de inovação em grafos

Detalhes bibliográficos
Ano de defesa: 2019
Autor(a) principal: Oliveira, Karina Bindandi Emboaba de
Orientador(a): Rodriguez, Pablo Martin lattes
Banca de defesa: Não Informado pela instituição
Tipo de documento: Tese
Tipo de acesso: Acesso aberto
Idioma: por
Instituição de defesa: Universidade Federal de São Carlos
Câmpus São Carlos
Programa de Pós-Graduação: Programa Interinstitucional de Pós-Graduação em Estatística - PIPGEs
Departamento: Não Informado pela instituição
País: Não Informado pela instituição
Palavras-chave em Português:
Palavras-chave em Inglês:
Área do conhecimento CNPq:
Link de acesso: https://repositorio.ufscar.br/handle/20.500.14289/11535
Resumo: Areas such as politics, economics and marketing are heavily influential in terms of information diffusion. For this reason, several branches of science have studied such phenomena in order to simulate and understand them by mathematical and/or stochastic models. In this context, this phd project aims to generalize innovation diffusion models that there is in the literature. The first model uses the social reinforcement mechanism for diffusion of innovation and which was built for the complete graph. In this case, we consider a finite population, closed, totally mixed and subdivided into four classes of individuals called ignorants, aware, adopters and abandoner of innovation. We prove a Law of Large Numbers and a Central Limit Theorem for the proportion of the population who have never heard about the innovation and those who know about ir but they have not adopted it yet. In addition, we also obtain result for the convergence of the maximum of adopter in a stochastic interval, as well as the instant of time that the process reaches that state. For this study, we used results of the theory of density dependent Markov chains. Furthermore, we formulated a stochastic model with structure stages to describe the phenomenon of innovation diffusion in a structured population. More precisely, we proposed a continuous time Markov chain defined in a population represented by the d-dimensional integer lattice. Each individual of the population must be in some of the M + 1 states belonging to the set {0,1,2,...,M}. In this sense, 0 stands for ignorant, i for i in {1,...,M-1} for aware in stage i and M for adopter. The arguments, that allow to obtain sufficient conditions under which the innovation either becomes extinct or survives with positive probability, are studied.
id SCAR_3c0211ec0924bb94a919f8fe3c5e01ec
oai_identifier_str oai:repositorio.ufscar.br:20.500.14289/11535
network_acronym_str SCAR
network_name_str Repositório Institucional da UFSCAR
repository_id_str
spelling Oliveira, Karina Bindandi Emboaba deRodriguez, Pablo Martinhttp://lattes.cnpq.br/6412853511887386http://lattes.cnpq.br/7198883875528090948af329-e5dd-43b4-99ee-a3c5175a75812019-07-19T13:00:41Z2019-07-19T13:00:41Z2019-04-12OLIVEIRA, Karina Bindandi Emboaba de. Modelos de difusão de inovação em grafos. 2019. Tese (Doutorado em Estatística) – Universidade Federal de São Carlos, São Carlos, 2019. Disponível em: https://repositorio.ufscar.br/handle/20.500.14289/11535.https://repositorio.ufscar.br/handle/20.500.14289/11535Areas such as politics, economics and marketing are heavily influential in terms of information diffusion. For this reason, several branches of science have studied such phenomena in order to simulate and understand them by mathematical and/or stochastic models. In this context, this phd project aims to generalize innovation diffusion models that there is in the literature. The first model uses the social reinforcement mechanism for diffusion of innovation and which was built for the complete graph. In this case, we consider a finite population, closed, totally mixed and subdivided into four classes of individuals called ignorants, aware, adopters and abandoner of innovation. We prove a Law of Large Numbers and a Central Limit Theorem for the proportion of the population who have never heard about the innovation and those who know about ir but they have not adopted it yet. In addition, we also obtain result for the convergence of the maximum of adopter in a stochastic interval, as well as the instant of time that the process reaches that state. For this study, we used results of the theory of density dependent Markov chains. Furthermore, we formulated a stochastic model with structure stages to describe the phenomenon of innovation diffusion in a structured population. More precisely, we proposed a continuous time Markov chain defined in a population represented by the d-dimensional integer lattice. Each individual of the population must be in some of the M + 1 states belonging to the set {0,1,2,...,M}. In this sense, 0 stands for ignorant, i for i in {1,...,M-1} for aware in stage i and M for adopter. The arguments, that allow to obtain sufficient conditions under which the innovation either becomes extinct or survives with positive probability, are studied.Áreas como política, economia e marketing sofrem grandes influências no que diz respeito à difusão de informação. Por este motivo, diversos ramos da ciência tem estudado tais fenômenos a fim de simulá-los e compreendê-los por meio de modelos matemáticos e/ou estocásticos. Em virtude disto, este trabalho de doutorado tem como objetivo generalizar modelos de difusão de inovação já existentes na literatura. O primeiro modelo utiliza o mecanismo de "social reinforcement" para difusão de inovação e o qual foi construído para o grafo completo. Neste caso, consideramos uma população finita, fechada, totalmente misturada e subdividida em quatro classes de indivíduos denominados ignorantes, conscientes, adotadores e abandonadores da inovação. Assim, será apresentado uma Lei Fraca dos Grandes Números e um Teorema Central do Limite para a proporção final da população que nunca escutou sobre a inovação e aqueles que já conhecem sobre ela mas ainda não adotaram. Ademais, também será apresentado um resultado de convergência para o máximo de adotadores em um intervalo estocástico, assim como o instante de tempo em que o processo atinge esse estado. Para esse estudo, foram utilizados resultados da teoria de cadeias de Markov dependentes da densidade. Ademais, formulamos um modelo estocástico com estrutura de estágios para descrever o fenômeno da difusão de inovação em uma população estruturada. Mais precisamente, propomos uma cadeia de Markov a tempo contínuo definida na rede hipercúbica d-dimensional. Cada indivíduo da população deve estar em algum dos M + 1 estados pertencentes ao conjunto {0,1,2,..,M}. Nesse sentido, 0 representa um ignorante, i para i pertencent {1,...,M-1} um consciente no estágio i e M um adotador. Dessa forma, são estudados argumentos que permitem encontrar condições suficientes nas quais a inovação se espalha ou não com probabilidade positiva.Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)FAPESP: 2014/23810-0porUniversidade Federal de São CarlosCâmpus São CarlosPrograma Interinstitucional de Pós-Graduação em Estatística - PIPGEsUFSCarDifusão de inovaçãoCadeias de Markov dependentes da densidadeProcesso de contatoTeoremas limitesModelos com "social reinforcement"Innovation diffusionDensity dependent Markov chainsContact processLimit theoremsSocial reinforcement modelsCIENCIAS EXATAS E DA TERRA::PROBABILIDADE E ESTATISTICAModelos de difusão de inovação em grafosInnovation diffusion graph modelsinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/doctoralThesisOnline600c0ac9225-5049-4ef6-ac59-e33587ab6264info:eu-repo/semantics/openAccessreponame:Repositório Institucional da UFSCARinstname:Universidade Federal de São Carlos (UFSCAR)instacron:UFSCARORIGINALTese_Total_Final_20190528.pdfTese_Total_Final_20190528.pdfTese de Doutorado Finalapplication/pdf1659132https://repositorio.ufscar.br/bitstreams/21febd85-57b0-4fe8-8d5c-baa75a92ae19/download09cdd51b5a3f50b86f402ca2c57764ccMD53trueAnonymousREADLICENSElicense.txtlicense.txttext/plain; charset=utf-81957https://repositorio.ufscar.br/bitstreams/8b08a4c8-fbb8-4d6f-a5eb-10137e294c19/downloadae0398b6f8b235e40ad82cba6c50031dMD55falseAnonymousREADTEXTTese_Total_Final_20190528.pdf.txtTese_Total_Final_20190528.pdf.txtExtracted texttext/plain102751https://repositorio.ufscar.br/bitstreams/80bbd292-6394-4bfb-880b-07efd19c40de/download28f2e8a25a1da75cb3231454025cce5dMD58falseAnonymousREADTHUMBNAILTese_Total_Final_20190528.pdf.jpgTese_Total_Final_20190528.pdf.jpgIM Thumbnailimage/jpeg4293https://repositorio.ufscar.br/bitstreams/94113ba3-b987-4279-b718-629e933391c6/download1821bd073633a6d1b9ccf62e08fb0f0fMD59falseAnonymousREAD20.500.14289/115352025-02-05 19:16:56.046Acesso abertoopen.accessoai:repositorio.ufscar.br:20.500.14289/11535https://repositorio.ufscar.brRepositório InstitucionalPUBhttps://repositorio.ufscar.br/oai/requestrepositorio.sibi@ufscar.bropendoar:43222025-02-05T22:16:56Repositório Institucional da UFSCAR - Universidade Federal de São Carlos (UFSCAR)falseTElDRU7Dh0EgREUgRElTVFJJQlVJw4fDg08gTsODTy1FWENMVVNJVkEKCkNvbSBhIGFwcmVzZW50YcOnw6NvIGRlc3RhIGxpY2Vuw6dhLCB2b2PDqiAobyBhdXRvciAoZXMpIG91IG8gdGl0dWxhciBkb3MgZGlyZWl0b3MgZGUgYXV0b3IpIGNvbmNlZGUgw6AgVW5pdmVyc2lkYWRlCkZlZGVyYWwgZGUgU8OjbyBDYXJsb3MgbyBkaXJlaXRvIG7Do28tZXhjbHVzaXZvIGRlIHJlcHJvZHV6aXIsICB0cmFkdXppciAoY29uZm9ybWUgZGVmaW5pZG8gYWJhaXhvKSwgZS9vdQpkaXN0cmlidWlyIGEgc3VhIHRlc2Ugb3UgZGlzc2VydGHDp8OjbyAoaW5jbHVpbmRvIG8gcmVzdW1vKSBwb3IgdG9kbyBvIG11bmRvIG5vIGZvcm1hdG8gaW1wcmVzc28gZSBlbGV0csO0bmljbyBlCmVtIHF1YWxxdWVyIG1laW8sIGluY2x1aW5kbyBvcyBmb3JtYXRvcyDDoXVkaW8gb3UgdsOtZGVvLgoKVm9jw6ogY29uY29yZGEgcXVlIGEgVUZTQ2FyIHBvZGUsIHNlbSBhbHRlcmFyIG8gY29udGXDumRvLCB0cmFuc3BvciBhIHN1YSB0ZXNlIG91IGRpc3NlcnRhw6fDo28KcGFyYSBxdWFscXVlciBtZWlvIG91IGZvcm1hdG8gcGFyYSBmaW5zIGRlIHByZXNlcnZhw6fDo28uCgpWb2PDqiB0YW1iw6ltIGNvbmNvcmRhIHF1ZSBhIFVGU0NhciBwb2RlIG1hbnRlciBtYWlzIGRlIHVtYSBjw7NwaWEgYSBzdWEgdGVzZSBvdQpkaXNzZXJ0YcOnw6NvIHBhcmEgZmlucyBkZSBzZWd1cmFuw6dhLCBiYWNrLXVwIGUgcHJlc2VydmHDp8Ojby4KClZvY8OqIGRlY2xhcmEgcXVlIGEgc3VhIHRlc2Ugb3UgZGlzc2VydGHDp8OjbyDDqSBvcmlnaW5hbCBlIHF1ZSB2b2PDqiB0ZW0gbyBwb2RlciBkZSBjb25jZWRlciBvcyBkaXJlaXRvcyBjb250aWRvcwpuZXN0YSBsaWNlbsOnYS4gVm9jw6ogdGFtYsOpbSBkZWNsYXJhIHF1ZSBvIGRlcMOzc2l0byBkYSBzdWEgdGVzZSBvdSBkaXNzZXJ0YcOnw6NvIG7Do28sIHF1ZSBzZWphIGRlIHNldQpjb25oZWNpbWVudG8sIGluZnJpbmdlIGRpcmVpdG9zIGF1dG9yYWlzIGRlIG5pbmd1w6ltLgoKQ2FzbyBhIHN1YSB0ZXNlIG91IGRpc3NlcnRhw6fDo28gY29udGVuaGEgbWF0ZXJpYWwgcXVlIHZvY8OqIG7Do28gcG9zc3VpIGEgdGl0dWxhcmlkYWRlIGRvcyBkaXJlaXRvcyBhdXRvcmFpcywgdm9jw6oKZGVjbGFyYSBxdWUgb2J0ZXZlIGEgcGVybWlzc8OjbyBpcnJlc3RyaXRhIGRvIGRldGVudG9yIGRvcyBkaXJlaXRvcyBhdXRvcmFpcyBwYXJhIGNvbmNlZGVyIMOgIFVGU0NhcgpvcyBkaXJlaXRvcyBhcHJlc2VudGFkb3MgbmVzdGEgbGljZW7Dp2EsIGUgcXVlIGVzc2UgbWF0ZXJpYWwgZGUgcHJvcHJpZWRhZGUgZGUgdGVyY2Vpcm9zIGVzdMOhIGNsYXJhbWVudGUKaWRlbnRpZmljYWRvIGUgcmVjb25oZWNpZG8gbm8gdGV4dG8gb3Ugbm8gY29udGXDumRvIGRhIHRlc2Ugb3UgZGlzc2VydGHDp8OjbyBvcmEgZGVwb3NpdGFkYS4KCkNBU08gQSBURVNFIE9VIERJU1NFUlRBw4fDg08gT1JBIERFUE9TSVRBREEgVEVOSEEgU0lETyBSRVNVTFRBRE8gREUgVU0gUEFUUk9Dw41OSU8gT1UKQVBPSU8gREUgVU1BIEFHw4pOQ0lBIERFIEZPTUVOVE8gT1UgT1VUUk8gT1JHQU5JU01PIFFVRSBOw4NPIFNFSkEgQSBVRlNDYXIsClZPQ8OKIERFQ0xBUkEgUVVFIFJFU1BFSVRPVSBUT0RPUyBFIFFVQUlTUVVFUiBESVJFSVRPUyBERSBSRVZJU8ODTyBDT01PClRBTULDiU0gQVMgREVNQUlTIE9CUklHQcOHw5VFUyBFWElHSURBUyBQT1IgQ09OVFJBVE8gT1UgQUNPUkRPLgoKQSBVRlNDYXIgc2UgY29tcHJvbWV0ZSBhIGlkZW50aWZpY2FyIGNsYXJhbWVudGUgbyBzZXUgbm9tZSAocykgb3UgbyhzKSBub21lKHMpIGRvKHMpCmRldGVudG9yKGVzKSBkb3MgZGlyZWl0b3MgYXV0b3JhaXMgZGEgdGVzZSBvdSBkaXNzZXJ0YcOnw6NvLCBlIG7Do28gZmFyw6EgcXVhbHF1ZXIgYWx0ZXJhw6fDo28sIGFsw6ltIGRhcXVlbGFzCmNvbmNlZGlkYXMgcG9yIGVzdGEgbGljZW7Dp2EuCg==
dc.title.por.fl_str_mv Modelos de difusão de inovação em grafos
dc.title.alternative.eng.fl_str_mv Innovation diffusion graph models
title Modelos de difusão de inovação em grafos
spellingShingle Modelos de difusão de inovação em grafos
Oliveira, Karina Bindandi Emboaba de
Difusão de inovação
Cadeias de Markov dependentes da densidade
Processo de contato
Teoremas limites
Modelos com "social reinforcement"
Innovation diffusion
Density dependent Markov chains
Contact process
Limit theorems
Social reinforcement models
CIENCIAS EXATAS E DA TERRA::PROBABILIDADE E ESTATISTICA
title_short Modelos de difusão de inovação em grafos
title_full Modelos de difusão de inovação em grafos
title_fullStr Modelos de difusão de inovação em grafos
title_full_unstemmed Modelos de difusão de inovação em grafos
title_sort Modelos de difusão de inovação em grafos
author Oliveira, Karina Bindandi Emboaba de
author_facet Oliveira, Karina Bindandi Emboaba de
author_role author
dc.contributor.authorlattes.por.fl_str_mv http://lattes.cnpq.br/7198883875528090
dc.contributor.author.fl_str_mv Oliveira, Karina Bindandi Emboaba de
dc.contributor.advisor1.fl_str_mv Rodriguez, Pablo Martin
dc.contributor.advisor1Lattes.fl_str_mv http://lattes.cnpq.br/6412853511887386
dc.contributor.authorID.fl_str_mv 948af329-e5dd-43b4-99ee-a3c5175a7581
contributor_str_mv Rodriguez, Pablo Martin
dc.subject.por.fl_str_mv Difusão de inovação
Cadeias de Markov dependentes da densidade
Processo de contato
Teoremas limites
Modelos com "social reinforcement"
topic Difusão de inovação
Cadeias de Markov dependentes da densidade
Processo de contato
Teoremas limites
Modelos com "social reinforcement"
Innovation diffusion
Density dependent Markov chains
Contact process
Limit theorems
Social reinforcement models
CIENCIAS EXATAS E DA TERRA::PROBABILIDADE E ESTATISTICA
dc.subject.eng.fl_str_mv Innovation diffusion
Density dependent Markov chains
Contact process
Limit theorems
Social reinforcement models
dc.subject.cnpq.fl_str_mv CIENCIAS EXATAS E DA TERRA::PROBABILIDADE E ESTATISTICA
description Areas such as politics, economics and marketing are heavily influential in terms of information diffusion. For this reason, several branches of science have studied such phenomena in order to simulate and understand them by mathematical and/or stochastic models. In this context, this phd project aims to generalize innovation diffusion models that there is in the literature. The first model uses the social reinforcement mechanism for diffusion of innovation and which was built for the complete graph. In this case, we consider a finite population, closed, totally mixed and subdivided into four classes of individuals called ignorants, aware, adopters and abandoner of innovation. We prove a Law of Large Numbers and a Central Limit Theorem for the proportion of the population who have never heard about the innovation and those who know about ir but they have not adopted it yet. In addition, we also obtain result for the convergence of the maximum of adopter in a stochastic interval, as well as the instant of time that the process reaches that state. For this study, we used results of the theory of density dependent Markov chains. Furthermore, we formulated a stochastic model with structure stages to describe the phenomenon of innovation diffusion in a structured population. More precisely, we proposed a continuous time Markov chain defined in a population represented by the d-dimensional integer lattice. Each individual of the population must be in some of the M + 1 states belonging to the set {0,1,2,...,M}. In this sense, 0 stands for ignorant, i for i in {1,...,M-1} for aware in stage i and M for adopter. The arguments, that allow to obtain sufficient conditions under which the innovation either becomes extinct or survives with positive probability, are studied.
publishDate 2019
dc.date.accessioned.fl_str_mv 2019-07-19T13:00:41Z
dc.date.available.fl_str_mv 2019-07-19T13:00:41Z
dc.date.issued.fl_str_mv 2019-04-12
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/doctoralThesis
format doctoralThesis
status_str publishedVersion
dc.identifier.citation.fl_str_mv OLIVEIRA, Karina Bindandi Emboaba de. Modelos de difusão de inovação em grafos. 2019. Tese (Doutorado em Estatística) – Universidade Federal de São Carlos, São Carlos, 2019. Disponível em: https://repositorio.ufscar.br/handle/20.500.14289/11535.
dc.identifier.uri.fl_str_mv https://repositorio.ufscar.br/handle/20.500.14289/11535
identifier_str_mv OLIVEIRA, Karina Bindandi Emboaba de. Modelos de difusão de inovação em grafos. 2019. Tese (Doutorado em Estatística) – Universidade Federal de São Carlos, São Carlos, 2019. Disponível em: https://repositorio.ufscar.br/handle/20.500.14289/11535.
url https://repositorio.ufscar.br/handle/20.500.14289/11535
dc.language.iso.fl_str_mv por
language por
dc.relation.confidence.fl_str_mv 600
dc.relation.authority.fl_str_mv c0ac9225-5049-4ef6-ac59-e33587ab6264
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.publisher.none.fl_str_mv Universidade Federal de São Carlos
Câmpus São Carlos
dc.publisher.program.fl_str_mv Programa Interinstitucional de Pós-Graduação em Estatística - PIPGEs
dc.publisher.initials.fl_str_mv UFSCar
publisher.none.fl_str_mv Universidade Federal de São Carlos
Câmpus São Carlos
dc.source.none.fl_str_mv reponame:Repositório Institucional da UFSCAR
instname:Universidade Federal de São Carlos (UFSCAR)
instacron:UFSCAR
instname_str Universidade Federal de São Carlos (UFSCAR)
instacron_str UFSCAR
institution UFSCAR
reponame_str Repositório Institucional da UFSCAR
collection Repositório Institucional da UFSCAR
bitstream.url.fl_str_mv https://repositorio.ufscar.br/bitstreams/21febd85-57b0-4fe8-8d5c-baa75a92ae19/download
https://repositorio.ufscar.br/bitstreams/8b08a4c8-fbb8-4d6f-a5eb-10137e294c19/download
https://repositorio.ufscar.br/bitstreams/80bbd292-6394-4bfb-880b-07efd19c40de/download
https://repositorio.ufscar.br/bitstreams/94113ba3-b987-4279-b718-629e933391c6/download
bitstream.checksum.fl_str_mv 09cdd51b5a3f50b86f402ca2c57764cc
ae0398b6f8b235e40ad82cba6c50031d
28f2e8a25a1da75cb3231454025cce5d
1821bd073633a6d1b9ccf62e08fb0f0f
bitstream.checksumAlgorithm.fl_str_mv MD5
MD5
MD5
MD5
repository.name.fl_str_mv Repositório Institucional da UFSCAR - Universidade Federal de São Carlos (UFSCAR)
repository.mail.fl_str_mv repositorio.sibi@ufscar.br
_version_ 1851688806764249088