Evolution of Social Power in Social Networks With Dynamic Topology

被引:65
作者
Ye, Mengbin [1 ,2 ]
Liu, Ji [3 ]
Anderson, Brian D. O. [2 ,4 ,5 ]
Yu, Changbin [1 ,2 ]
Basar, Tamer [6 ]
机构
[1] Westlake Univ, Westlake Inst Adv Study, Inst Adv Technol, Hangzhou 310024, Zhejiang, Peoples R China
[2] Australian Natl Univ, Res Sch Engn, Canberra, ACT 2601, Australia
[3] SUNY Stony Brook, Dept Elect & Comp Engn, Stony Brook, NY 11794 USA
[4] Hangzhou Dianzi Univ, Hangzhou 310000, Zhejiang, Peoples R China
[5] Data61 CSIRO, Canberra, ACT 2601, Australia
[6] Univ Illinois, Coordinated Sci Lab, Urbana, IL 61801 USA
基金
澳大利亚研究理事会;
关键词
Discrete-time; dynamic topology; nonlinear contraction analysis; opinion dynamics; social networks; social power; LOOKING-GLASS SELF; OPINION DYNAMICS; CONSENSUS; SYSTEMS; COORDINATION; MATRICES;
D O I
10.1109/TAC.2018.2805261
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The recently proposed DeGroot-Fried kin model describes the dynamical evolution of individual social power in a social network that holds opinion discussions on a sequence of different issues. This paper revisits that model, and uses nonlinear contraction analysis, among other tools, to establish several novel results. First, we show that for a social network with constant topology, each individual's social power converges to its equilibrium value exponentially fast, whereas previous results only concluded asymptotic convergence. Second, when the network topology is dynamic (i.e., the relative interaction matrix may change between any two successive issues), we show that the initial (perceived) social power of each individual is exponentially forgotten. Specifically, individual social power is dependent only on the dynamic network topology, and initial social power is forgotten as a result of sequential opinion discussion. Finally, we provide an explicit upper bound on an individual's social power as the number of issues discussed tends to infinity; this bound depends only on the network topology. Simulations are provided to illustrate our results.
引用
收藏
页码:3793 / 3808
页数:16
相关论文
共 41 条
[1]   Predictable Dynamics of Opinion Forming for Networks With Antagonistic Interactions [J].
Altafini, Claudio ;
Lini, Gabriele .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2015, 60 (02) :342-357
[2]   Consensus Problems on Networks With Antagonistic Interactions [J].
Altafini, Claudio .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2013, 58 (04) :935-946
[3]  
[Anonymous], 1964, CONTRIBUTION MATH PS
[4]  
[Anonymous], 2001, ALGEBRAIC GRAPH THEO
[5]  
[Anonymous], 2014, Matrix analysis
[6]  
[Anonymous], 2006, STRUCTURAL THEORY SO
[7]  
[Anonymous], 2003, PROC ACM SIGKDD INT
[8]   Network dynamics of social influence in the wisdom of crowds [J].
Becker, Joshua ;
Brackbill, Devon ;
Centola, Damon .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2017, 114 (26) :E5070-E5076
[9]   The boundedness of all products of a pair of matrices is undecidable [J].
Blondel, VD ;
Tsitsiklis, JN .
SYSTEMS & CONTROL LETTERS, 2000, 41 (02) :135-140
[10]  
Cartwright D.P., 1959, Studies in social power