113 research outputs found

    Diffusion of innovations in social networks

    Get PDF
    While social networks do affect diffusion of innovations, the exact nature of these effects are far from clear, and, in many cases, there exist conflicting hypotheses among researchers. In this paper, we focus on the linear threshold model where each individual requires exposure to (potentially) multiple sources of adoption in her neighborhood before adopting the innovation herself. In contrast with the conclusions in the literature, our bounds suggest that innovations might spread further across networks with a smaller degree of clustering. We provide both analytical evidence and simulations for our claims. Finally, we propose an extension for the linear threshold model to better capture the notion of path dependence, i.e., a few minor shocks along the way could alter the course of diffusion significantly.Charles Stark Draper Laboratory. Independent Research and Development. University Research & DevelopmentNational Science Foundation (U.S.). (Grant number SES-0729361)United States. Air Force Office of Scientific Research (Grant number FA9550-09-1-0420)United States. Air Force Office of Scientific Research. (Grant number W911NF-09-1-0556

    A primer on noise-induced transitions in applied dynamical systems

    Full text link
    Noise plays a fundamental role in a wide variety of physical and biological dynamical systems. It can arise from an external forcing or due to random dynamics internal to the system. It is well established that even weak noise can result in large behavioral changes such as transitions between or escapes from quasi-stable states. These transitions can correspond to critical events such as failures or extinctions that make them essential phenomena to understand and quantify, despite the fact that their occurrence is rare. This article will provide an overview of the theory underlying the dynamics of rare events for stochastic models along with some example applications

    Automating agent-based modeling : data-driven generation and application of innovation diffusion models

    Get PDF
    Simulation modeling is useful to understand the mechanisms of the diffusion of innovations, which can be used for forecasting the future of innovations. This study aims to make the identification of such mechanisms less costly in time and labor. We present an approach that automates the generation of diffusion models by: (1) preprocessing of empirical data on the diffusion of a specific innovation, taken out by the user; (2) testing variations of agent-based models for their capability of explaining the data; (3) assessing interventions for their potential to influence the spreading of the innovation. We present a working software implementation of this procedure and apply it to the diffusion of water-saving showerheads. The presented procedure successfully generated simulation models that explained diffusion data. This progresses agent-based modeling methodologically by enabling detailed modeling at relative simplicity for users. This widens the circle of persons that can use simulation to shape innovation

    Diffusion of Innovation in Small-world Networks with Social Interactions

    Get PDF
    ν•™μœ„λ…Όλ¬Έ (박사)-- μ„œμšΈλŒ€ν•™κ΅ λŒ€ν•™μ› : ν˜‘λ™κ³Όμ • κΈ°μˆ κ²½μ˜Β·κ²½μ œΒ·μ •μ±…μ „κ³΅, 2015. 2. μ΄μ’…μˆ˜.인터넷과 무선톡신, μ‚¬νšŒμ—°κ²°λ§μ„œλΉ„μŠ€ λ“±μ˜ λ“±μž₯으둜 μ‚¬νšŒ λ„€νŠΈμ›Œν¬κ°€ λ°œμ „ν•˜λ©΄μ„œ, μ˜ˆμ „λ³΄λ‹€ μ†ŒλΉ„μžλ“€μ€ μ„œλ‘œ 더 자주, μ‹ μ†ν•˜κ²Œ 정보λ₯Ό κ΅ν™˜ν•˜κ³  μ„œλ‘œμ˜ μ œν’ˆ ꡬ맀에 영ν–₯을 미치고 μžˆλ‹€. κ·ΈλŸ¬λ‚˜, 기쑴에 널리 μ΄μš©λ˜μ–΄ 온 배슀 λͺ¨ν˜•μ„ λΉ„λ‘―ν•œ μ—¬λŸ¬ ν™•μ‚° 예츑 λͺ¨ν˜•λ“€μ€ 이둠적 기반이 μ·¨μ•½ν•  뿐만 μ•„λ‹ˆλΌ, μ‹œμž₯ μˆ˜μ€€μ—μ„œμ˜ λΆ„μ„λ§Œμ„ ν–‰ν•˜κ³  있기 λ•Œλ¬Έμ— μ΄λŸ¬ν•œ μ†ŒλΉ„μžκ°„ μƒν˜Έμž‘μš©μ˜ 효과λ₯Ό 톡합적이고 ν•œμ •μ μœΌλ‘œ λ°˜μ˜ν•˜κ³  μžˆμ–΄ 졜근의 μ‚¬νšŒ ν˜„μƒμ„ μ œλŒ€λ‘œ μ„€λͺ…ν•˜μ§€ λͺ»ν•˜λŠ” ν•œκ³„κ°€ μžˆλ‹€. κ·Έ λŒ€μ•ˆμœΌλ‘œ λ“±μž₯ν•œ ν–‰μœ„μž 기반 λͺ¨ν˜•λ“€μ€ 개인 λ‹¨μœ„ 뢄석을 κ°€λŠ₯ν•˜κ²Œ ν•œ μž₯점은 μžˆμœΌλ‚˜, μ—¬μ „νžˆ 이둠적 기반이 μ·¨μ•½ν•˜κ³  총 μ‹œμž₯ μˆ˜μ€€ 자료λ₯Ό ν†΅ν•œ 뢄석은 μš”μ›ν•œ 싀정이닀. 이 μ—°κ΅¬μ—μ„œλŠ” μ†ŒλΉ„μžλ“€μ΄ μ„œλ‘œμ˜ μ„ νƒμœΌλ‘œλΆ€ν„° 영ν–₯을 λ°›λŠ” μ‚¬νšŒμ  νš¨μš©ν•¨μˆ˜κ°€ μžˆλ‹€κ³  κ°€μ •ν•˜κ³ , 이와 같은 μ‚¬νšŒμ  μƒν˜Έμž‘μš©μœΌλ‘œλΆ€ν„° μ˜€λŠ” νš¨μš©μ„ 개개인의 νš¨μš©κ΅¬μ‘°μ— μ§μ ‘μ μœΌλ‘œ λ°˜μ˜μ‹œμΌœ 이것이 ν™•μ‚° 곑선에 μ–΄λ–€ 영ν–₯을 λ―ΈμΉ˜λŠ” 지λ₯Ό μƒν˜Έμž‘μš© 기반 ν™•μ‚° λͺ¨ν˜•μ΄λΌ λͺ…λͺ…λœ μƒˆλ‘œμš΄ λͺ¨ν˜•μ„ 톡해 보고자 ν•œλ‹€. λ˜ν•œ 기쑴의 λŒ€ν‘œμ μΈ ν™•μ‚° λͺ¨ν˜•κ³Όμ˜ 비ꡐλ₯Ό 톡해 μ‹€μ œλ‘œ λ³Έ λͺ¨ν˜•μ΄ 졜근의 μ‚¬νšŒ ν˜„μƒμ„ μ„€λͺ…ν•˜λŠ” 데 μ ν•©ν•œ 지 μ‚΄νŽ΄λ³΄κ³ μž ν•œλ‹€. λ”λΆˆμ–΄, ν˜μ‹  확산을 잘 μ„€λͺ…ν•˜κΈ° μœ„ν•΄μ„œλŠ” μœ„ν•΄μ„œλŠ” 기쑴에 널리 μ‚¬μš©λ˜μ—ˆλ˜ μ„Έν¬μžλ™μž κ²©μžκ΅¬μ‘°λ³΄λ‹€λŠ” μž‘μ€ 세상 연결망 μ‚¬νšŒκ΅¬μ‘°κ°€ 더 적합함을 λ°νžŒλ‹€. 이 연ꡬλ₯Ό 톡해, 개인의 효용과 μƒν˜Έμž‘μš©μ— κΈ°λ°˜ν•œ κ²½μ œν•™μ  ν™•μ‚° λͺ¨ν˜•μ„ 얻을 수 μžˆμ—ˆμ„ 뿐만 μ•„λ‹ˆλΌ, κΈ°μ‘΄ ν™•μ‚° λͺ¨ν˜•κ³Ό 달리 μƒν˜Έμž‘μš©μ˜ μ΄μ§ˆμ„±κΉŒμ§€ λ°˜μ˜ν•  수 μžˆλŠ” ν™•μ‚° λͺ¨ν˜•μ„ ꡬ좕할 수 μžˆμ—ˆλ‹€. λ˜ν•œ λ³Έ μ—°κ΅¬λŠ” 개인 λ‹¨μœ„μ˜ λͺ¨ν˜•μ΄ μ‹œμž₯ 전체 μˆ˜μ€€μ˜ μˆ˜μš” μ˜ˆμΈ‘μ— ν™œμš©λ  수 μžˆλŠ” μƒˆλ‘œμš΄ 접근방식을 μ œμ•ˆν•˜κ³  있으며, μ‹€μ œ 자료의 뢄석에 λŒ€ν•΄μ„œλ„ λͺ¨ν˜•μ΄ μΆ©λΆ„νžˆ ν™œμš©κ°€λŠ₯ ν•  수 μžˆμŒμ„ λ³΄μ˜€λ‹€. 이 μ—°κ΅¬μ—μ„œ μ œμ‹œν•˜λŠ” λͺ¨ν˜•μ€ κ²½μ œν•™μ  이둠에 κΈ°λ°˜μ„ λ‘μ—ˆκΈ° λ•Œλ¬Έμ— 연ꡬ λŒ€μƒμ— λ”°λ₯Έ ν™•μž₯이 μš©μ΄ν•˜λ‹€λŠ” μž₯점이 있으며, μ΄λŸ¬ν•œ 일반적인 λͺ¨ν˜• ꡬ좕은 ν–₯ν›„ ν™•μ‚° 과정에 λŒ€ν•œ 이해λ₯Ό λ”μš± ν™•μž₯μ‹œμΌœ 쀄 수 μžˆμ„ κ²ƒμœΌλ‘œ κΈ°λŒ€ν•œλ‹€.The advent of the Internet, mobile communications, and social network services has stimulated social interactions among consumers, allowing people to affect one anothers innovation adoptions by exchanging information more frequently and more quickly. Previous diffusion models, such as the Bass model, however, face limitations in reflecting such recent phenomena in society. These models are weak in their ability to model interactions between agentsthey model aggregated-level behaviors only. The agent-based model, which is an alternative to the aggregate model, is good for individual modeling, but it is still not based on an economic perspective of social interactions so far. This study assumes the presence of social utility from other consumers in the adoption of innovation and investigates the effect of individual interactions on innovation diffusion by developing a new model called the interaction-based diffusion model. By comparing this model with previous diffusion models, the study also examines how the proposed model explains innovation diffusion from the perspective of economics. In addition, the study recommends the use of a small-world network topology instead of cellular automata to describe innovation diffusion. This study develops a model based on individual preference and heterogeneous social interactions using utility specification, which is expandable and, thus, able to encompass various issues in diffusion research, such as reservation price. Furthermore, the study proposes a new framework to forecast aggregated-level market demand from individual-level modeling. The model also exhibits a good fit to real market data. It is expected that the study will contribute to our understanding of the innovation diffusion process through its microeconomic theoretical approach.Abstract iii Contents v List of Tables vii List of Figures viii Chapter 1. Introduction 1 1.1 Research Background 1 1.2 Objective of the Study 3 1.3 Outline of the Study 4 Chapter 2. Literature Review 7 2.1 Overview of the Diffusion of Innovation 7 2.2 Diffusion Models 12 2.2.1 Aggregate Models 13 2.2.2 Agent-Based Models 20 2.2.3 Diffusion models based on individual behavior 26 2.3 Interaction-Based Model 31 2.4 Research Motivation 36 Chapter 3. Interaction-Based Diffusion Model 41 3.1 Utility Model 41 3.2 Structure of Social Network 52 3.3 Diffusion Process 61 Chapter 4. Interpretation of the Interaction-Based Diffusion Model 65 4.1 Specification of Simulation 65 4.2 Simulation Results 74 4.2.1 Effect of Price Coefficients 78 4.2.2 Effect of Social Interactions 87 4.3 Summary 92 Chapter 5. Empirical Availability of the Interaction-Based Diffusion Model 99 5.1 Adjustment of the Model for Fitting 99 5.2 Analysis of Real Market Data 111 5.2.1 Fitting Procedure 111 5.2.2 Analysis Results 114 5.3 Summary 119 Chapter 6. Conclusion 121 6.1 Concluding Remarks 121 6.2 Contributions and Limitations 122 6.3 Future Research Topics 125 Bibliography 127 Appendix I: Raw data of mobile communication subscriptions in three countries. 143 Abstract (Korean) 145Docto

    Stochastic Algorithms in Riemannian Manifolds and Adaptive Networks

    Full text link
    The combination of adaptive network algorithms and stochastic geometric dynamics has the potential to make a large impact in distributed control and signal processing applications. However, both literatures contain fundamental unsolved problems. The thesis is thus in two main parts. In part I, we consider stochastic differential equations (SDEs) evolving in a matrix Lie group. To undertake any kind of statistical signal processing or control task in this setting requires the simulation of such geometric SDEs. This foundational issue has barely been addressed previously. Chapter 1 contains background and motivation. Chapter 2 develops numerical schemes for simulating SDEs that evolve in SO(n) and SE(n). We propose novel, reliable, efficient schemes based on diagonal PadΓ© approximants, where each trajectory lies in the respective manifold. We prove first order convergence in mean uniform squared error using a new proof technique. Simulations for SDEs in SO(50) are provided. In part II, we study adaptive networks. These are collections of individual agents (nodes) that cooperate to solve estimation, detection, learning and adaptation problems in real time from streaming data, without a fusion center. We study general diffusion LMS algorithms - including real time consensus - for distributed MMSE parameter estimation. This choice is motivated by two major flaws in the literature. First, all analyses assume the regressors are white noise, whereas in practice serial correlation is pervasive. Dealing with it however is much harder than the white noise case. Secondly, since the algorithms operate in real time, we must consider realization-wise behavior. There are no such results. To remedy these flaws, we uncover the mixed time scale structure of the algorithms. We then perform a novel mixed time scale stochastic averaging analysis. Chapter 3 contains background and motivation. Realization-wise stability (chapter 4) and performance including network MSD, EMSE and realization-wise fluctuations (chapter 5) are then studied. We develop results in the difficult but realistic case of serial correlation. We observe that the popular ATC, CTA and real time consensus algorithms are remarkably similar in terms of stability and performance for small constant step sizes. Parts III and IV contain conclusions and future work
    • …
    corecore