Analysis of Tipping Points for Threshold Models on Arbitrary Networks임의의 소셜 네트워크 구조에서의 정보 확산 Tipping Point 조건 분석

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 610
  • Download : 0
Diffusion of new ideas, technologies or epidemics via various social networks has been extensively studied for decades. In particular, Kempe, Kleinberg, and Tardos proposed the \emph{general threshold model}, a generalization of many diffusion models on networks which is based on utility maximization of individuals in game theoretic consideration. Despite its importance, the analysis under the threshold model, however, has concentrated on special cases such as the submodular influence, homogeneous thresholds, and locally tree-like networks. In this paper, we consider the general threshold model~ with arbitrary threshold distributions on arbitrary networks. We prove that only if (essentially) all nodes have degrees ω(log n), the final cascade size is highly concentrated around its mean with high probability for a large class of general threshold models including the linear threshold model, the independent cascade model, and the Katz-Shapiro pricing model. We also prove that in those cases, the expectation of the cascade size is asymptotically invariant of the network structures and provide a formula to compute the average cascade size, if initial adopters are chosen uniformly at random. Hence, even if network structures are not known, we can still estimate the final cascade size. We also extend our results to arbitrary general threshold models and provide upper and lower bounds for the cascade size. We then provide an efficient algorithm that estimates the average cascade size for the general threshold model. Our algorithm also computes the probability of being influenced for each individual. Our results allow us to predict when a phase transition for a large spreading happens. Since our algorithm estimates the final cascade size efficiently, it can be also used as a subroutine in many algorithms for the influence maximization problem. Through extensive experiments on several real-world and synthetic networks, we confirm that the cascade size is actually concen...
Advisors
Jung, Kyo-Minresearcher정교민
Description
한국과학기술원 : 전산학과,
Publisher
한국과학기술원
Issue Date
2012
Identifier
487445/325007  / 020093373
Language
eng
Description

학위논문(석사) - 한국과학기술원 : 전산학과, 2012.2, [ iv, 23 p. ]

Keywords

Information Diffusion; Tipping Points; Social Networks; 정보 확산; 티핑 포인트; 영향력 최대화; 소셜 네트워크; Influence Maximization

URI
http://hdl.handle.net/10203/180531
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=487445&flag=dissertation
Appears in Collection
CS-Theses_Master(석사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0