請用此 Handle URI 來引用此文件：
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/67678完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.advisor | 周雲雄(Yunshyong Chow) | |
| dc.contributor.author | Szu-Hsien Ho | en |
| dc.contributor.author | 何思賢 | zh_TW |
| dc.date.accessioned | 2021-06-17T01:43:40Z | - |
| dc.date.available | 2017-07-31 | |
| dc.date.copyright | 2017-07-31 | |
| dc.date.issued | 2017 | |
| dc.date.submitted | 2017-07-27 | |
| dc.identifier.citation | [1] Callaway, Duncan S., Mark E. J. Newman, Steven H. Strogatz, S. and Duncan J. Watts. 2000. “Network Robustness and Fragility: Percolation on Random Graphs.” Physical Review Letters 85 (25): 5468lC71.
[2] Erd¨os, Paul, and Alfrled R´enyi. 1959. “On Random Graphs.” Publicationes Mathematicae 6: 290lC97. [3] Erd¨os, Paul, and Alfrled R´enyi. 1960. “On the Rvolution of Random Graphs.” Publications of the Mathematical Institute of the Hungarian Academy of Sciences 5: 17lC61. [4] Erd¨os, Paul, and Alfrled R´enyi. 1961. “On the Strength of Connectedness of a Random Graph.” Acta Mathematica Scienta Hungary 12 (1lC2): 261lC67. [5] Jackson, Matthew O. 2008. Social and Economics Networks. Princeton: Princeton University Press. [6] Jackson, Matthew O., and Brian W. Rogers. 2007. “Relating Network Structure to Diffusion Properties through Stochastic Dominance.” B. E. Journal of Theoretical Economics: Advances in Theoretical Economics 7 (1): 1lC13. [7] Jackson, Matthew O., and Leeat Yariv. 2007. “Diffusion of Behavior and Equilibrium Properties in Network Games.” American Economic Review 97 (2): 92lC98. [8] Lopez-Pintado, Dunia. 2008. “Diffusion in Complex Social Networks.” Games and Economic Behavior 62 (2): 573lC90. [9] Molloy, Michael, and Bruce Reed. 1995. “A Critical Point for Random Graphs with a Given Degree Sequence.” Random Structures and Algorithms 6 (2lC3): 161lC80. [10] Newman, Mark E. J. 2002. “The Spread of Epidemic Diseases on Networks.”Physical Review E 66 (1): 016128. [11] Newman, Mark E. J., Steven H. Strogatz, and Duncan J.Watts. 2001. “Random Graphs with Arbitrary Degree Distributions and their Applications.” Physical Review E 64 (2): 026118. [12] Watts, Duncan J. 2002. “A Simple Model of Cascades on Random Networks.”Proceedings of the National Academy of Sciences of the United States of America 99 (9): 5766lC771. [13] Young, H. Peyton. 2009. “Innovation Diffusion in Heterogeneous Populations: Contagion, Social Influence, and Social Learning.” American Economic Review 99 (5): 1899lC924. | |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/67678 | - |
| dc.description.abstract | 本研究奠基於隨機圖框架以及展透理論，發展一個模型，刻畫社會網路中的資訊傳播。我們考慮的情境如下：一個獨佔廠商賣商品給消費者群眾，大多數消費者初始對商品一無所知。他們必須經由朋友傳遞商品的資訊，才會考慮購買。我們發現，若消費者對商品的評價與他的朋友數是相互獨立的隨機變數，相較於所有消費者初始都知道商品資訊的情境，需求將更有彈性，而此廠商將也會訂一個較低的價格。然而，這些結果在更一般的假定下不一定會成立。我們構建一個消費者評價與朋友數具有相關性的例子，導出相反的結果。 | zh_TW |
| dc.description.abstract | In this study, a model based on random graph framework and percolation theory is developed to characterize information spread in social networks. A monopolist sells a product to a population of consumers, and initially most people do not learn about the product. They must receive the information from their friends about such product in order to consider buying it. It is shown that, the demand is more elastic and the price charged by the monopolist is lower than the case that initially all the consumers have learned about the product, provided that the valuation and the number of friends of an individual are independent. However, these results may not hold in general. An example is given to show that these results may be reversed if there is correlation between the valuation of consumers and the number of friends. | en |
| dc.description.provenance | Made available in DSpace on 2021-06-17T01:43:40Z (GMT). No. of bitstreams: 1 ntu-106-R01221034-1.pdf: 1286463 bytes, checksum: c1ea8824dea11475005bd8cd3832cc6c (MD5) Previous issue date: 2017 | en |
| dc.description.tableofcontents | 謝辭 i
摘要 iii Abstract v List of Figures ix List of Tables ix Chapter 1 Introduction 1 1.1 Related Literature . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 Chapter 2 Model Setup 4 2.1 Random Graph . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.2 Notations and Assumptions . . . . . . . . . . . . . . . . . . . . . . . 6 2.3 Probability Generating Functions . . . . . . . . . . . . . . . . . . . . 7 Chapter 3 Analysis: Baseline Model 12 3.1 Critical Price . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 3.2 Demand . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 3.3 Pricing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 3.4 Special Types of Random Networks . . . . . . . . . . . . . . . . . . . 18 Chapter 4 Extension 27 4.1 More General Forms of Information Spread Probability . . . . 27 4.2 Correlations between Valuations v and Number of Friends k . . . . . 31 Chapter 5 Conclusion 34 Bibliography 36 | |
| dc.language.iso | en | |
| dc.subject | 展透過程 | zh_TW |
| dc.subject | 隨機圖 | zh_TW |
| dc.subject | 最大連通分支 | zh_TW |
| dc.subject | 需求的價格彈性 | zh_TW |
| dc.subject | price elasticity of demand | en |
| dc.subject | percolation process | en |
| dc.subject | giant component | en |
| dc.subject | random graph | en |
| dc.title | 社會網路中的資訊傳播 | zh_TW |
| dc.title | Information Spread in Social Networks | en |
| dc.type | Thesis | |
| dc.date.schoolyear | 105-2 | |
| dc.description.degree | 碩士 | |
| dc.contributor.oralexamcommittee | 姜祖恕(Tzuu-Shuh Chiang),許順吉(Shuenn-Jyi Sheu) | |
| dc.subject.keyword | 隨機圖,展透過程,最大連通分支,需求的價格彈性, | zh_TW |
| dc.subject.keyword | random graph,percolation process,giant component,price elasticity of demand, | en |
| dc.relation.page | 37 | |
| dc.identifier.doi | 10.6342/NTU201702167 | |
| dc.rights.note | 有償授權 | |
| dc.date.accepted | 2017-07-27 | |
| dc.contributor.author-college | 理學院 | zh_TW |
| dc.contributor.author-dept | 數學研究所 | zh_TW |
| 顯示於系所單位： | 數學系 | |
文件中的檔案：
| 檔案 | 大小 | 格式 | |
|---|---|---|---|
| ntu-106-1.pdf 未授權公開取用 | 1.26 MB | Adobe PDF |
系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。