Graph-Theoretic Analysis of Belief System Dynamics under Logic Constraints

Opinion formation cannot be modeled solely as an ideological deduction from a set of principles; rather, repeated social interactions and logic constraints among statements are consequential in the construct of belief systems. We address three basic questions in the analysis of social opinion dynamics: (i) Will a belief system converge? (ii) How long does it take to converge? (iii) Where does it converge? We provide graph-theoretic answers to these questions for a model of opinion dynamics of a belief system with logic constraints. Our results make plain the implicit dependence of the convergence properties of a belief system on the underlying social network and on the set of logic constraints that relate beliefs on different statements. Moreover, we provide an explicit analysis of a variety of commonly used large-scale network models.

[1]  P. M. Weichsel.  THE KRONECKER PRODUCT OF GRAPHS , 1962 .

[2]  M. Mcandrew.  On the product of directed graphs , 1963 .

[3]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[4]  M. Degroot.  Reaching a Consensus , 1974 .

[5]  B. Bollobás.  The evolution of random graphs , 1984 .

[6]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[7]  S. Feldman.  Structure and Consistency in Public Opinion: the Role of Core Beliefs and Values , 1988 .

[8]  David J. Aldous,et al.  Lower bounds for covering times for reversible Markov chains and random walks on graphs , 1989 .

[9]  P. Diaconis,et al.  Geometric Bounds for Eigenvalues of Markov Chains , 1991 .

[10]  T. Lindvall.  Lectures on the Coupling Method , 1992 .

[11]  M. Newman,et al.  Renormalization Group Analysis of the Small-World Network Model , 1999, cond-mat/9903357.

[12]  W. Imrich,et al.  Product Graphs: Structure and Recognition , 2000 .

[13]  Duncan J. Watts,et al.  Book Review: Small Worlds. The Dynamics of Networks Between Order and Randomness , 2000 .

[14]  Stefan Bornholdt,et al.  Handbook of Graphs and Networks: From the Genome to the Internet , 2003 .

[15]  Albert-László Barabási,et al.  Linked - how everything is connected to everything else and what it means for business, science, and everyday life , 2003 .

[16]  Mathew D. Penrose,et al.  Random Geometric Graphs , 2003 .

[17]  F. Amblard,et al.  The role of network topology on extremism propagation with the Relative Agreement opinion dynamics , 2004 .

[18]  P. Converse.  The Nature of Belief Systems in Mass Publics , 2004 .

[19]  Santo Fortunato.  Damage spreading and opinion dynamics on scale-free networks , 2005 .

[20]  Stephen P. Boyd,et al.  Mixing Times for Random Walks on Geometric Random Graphs , 2005, ALENEX/ANALCO.

[21]  U. Krause,et al.  Opinion Dynamics Driven by Various Ways of Averaging , 2005 .

[22]  Chen Avin,et al.  Bounds on the mixing time and partial cover of ad-hoc and sensor networks , 2005, Proceeedings of the Second European Workshop on Wireless Sensor Networks, 2005..

[23]  Prabhakar Raghavan,et al.  The electrical resistance of a graph captures its commute and cover times , 2005, computational complexity.

[24]  P. Converse.  The nature of belief systems in mass publics (1964) , 2006, The Nature of Belief Systems Reconsidered.

[25]  László Lovász,et al.  Blocking Conductance and Mixing in Random Walks , 2006, Combinatorics, Probability and Computing.

[26]  B. Reed,et al.  The Evolution of the Mixing Rate , 2007, math/0701474.

[27]  Christos Faloutsos,et al.  Graph evolution: Densification and shrinking diameters , 2006, TKDD.

[28]  Alireza Tahbaz-Salehi,et al.  Small world phenomenon, rapidly mixing Markov chains, and average consensus algorithms , 2007, 2007 46th IEEE Conference on Decision and Control.

[29]  Chen Avin,et al.  On the cover time and mixing time of random geometric graphs , 2007, Theor. Comput. Sci..

[30]  R. Durrett.  Random Graph Dynamics: References , 2006 .

[31]  Guy Bresler,et al.  Mixing Time of Exponential Random Graphs , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[32]  Ilan Lobel,et al.  BAYESIAN LEARNING IN SOCIAL NETWORKS , 2008 .

[33]  Elizabeth L. Wilmer,et al.  Markov Chains and Mixing Times , 2008 .

[34]  Brian D. O. Anderson,et al.  Reaching a Consensus in a Dynamically Changing Environment: Convergence Rates, Measurement Delays, and Asynchronous Events , 2008, SIAM J. Control. Optim..

[35]  Y. Peres,et al.  Critical random graphs: Diameter and mixing time , 2007, math/0701316.

[36]  Brian D. O. Anderson,et al.  Reaching a Consensus in a Dynamically Changing Environment: Convergence Rates, Measurement Delays, and Asynchronous Events , 2008, SIAM J. Control. Optim..

[37]  Ronald L. Rivest,et al.  Introduction to Algorithms, third edition , 2009 .

[38]  Niloy Ganguly,et al.  Dynamics On and Of Complex Networks: Applications to Biology, Computer Science, and the Social Sciences , 2009 .

[39]  Jason E. Fulman,et al.  Mixing Time for a Random Walk on Rooted Trees , 2009, Electron. J. Comb..

[40]  Ravi Montenegro.  The simple random walk and max-degree walk on a directed graph , 2009 .

[41]  Masafumi Yamashita,et al.  The hitting and cover times of random walks on finite graphs using local degree information , 2009, Theor. Comput. Sci..

[42]  Jure Leskovec,et al.  Signed networks in social media , 2010, CHI.

[43]  Wenwu Yu,et al.  Some necessary and sufficient conditions for second-order consensus in multi-agent dynamical systems , 2010, Autom..

[44]  Yuval Peres,et al.  Anatomy of a young giant component in the random graph , 2009, Random Struct. Algorithms.

[45]  B. Gerencsér.  Markov chain mixing time on cycles , 2011 .

[46]  John N. Tsitsiklis,et al.  Degree fluctuations and the convergence time of consensus algorithms , 2013, IEEE Conference on Decision and Control and European Control Conference.

[47]  Noah E. Friedkin,et al.  Social Influence Network Theory: A Sociological Examination of Small Group Dynamics , 2011 .

[48]  Y. Peres,et al.  Mixing time of near-critical random graphs , 2009, 0908.3870.

[49]  Francesco Bullo,et al.  Opinion Dynamics in Heterogeneous Networks: Convergence Conjectures and Theorems , 2011, SIAM J. Control. Optim..

[50]  Jure Leskovec,et al.  Learning to Discover Social Circles in Ego Networks , 2012, NIPS.

[51]  Ming Cao,et al.  Interacting with Networks: How Does Structure Relate to Controllability in Single-Leader, Consensus Networks? , 2012, IEEE Control Systems.

[52]  Meng Wang,et al.  Exact Mixing Times for Random Walks on Trees , 2013, Graphs Comb..

[53]  Jure Leskovec,et al.  {SNAP Datasets}: {Stanford} Large Network Dataset Collection , 2014 .

[54]  Alex Olshevsky,et al.  Linear Time Average Consensus on Fixed Graphs and Implications for Decentralized Optimization and Multi-Agent Control , 2014, 1411.4186.

[55]  Y. Peres,et al.  Uniform mixing time for random walk on lamplighter graphs , 2011, 1109.4281.

[56]  Nicholas C. Wormald,et al.  The mixing time of the giant component of a random graph , 2006, Random Struct. Algorithms.

[57]  Luís E. T. Rodrigues,et al.  Random Walks on Evolving Graphs with Recurring Topologies , 2014, DISC.

[58]  Noah E. Friedkin,et al.  The Problem of Social Control and Coordination of Complex Systems in Sociology: A Look at the Community Cleavage Problem , 2015, IEEE Control Systems.

[59]  Tao Lei,et al.  The Mixing Time of the Newman-Watts Small-World Model , 2012, Advances in Applied Probability.

[60]  C. Butts.  Why I know but don't believe , 2016, Science.

[61]  Roberto Tempo,et al.  Network science on belief system dynamics under logic constraints , 2016, Science.

[62]  Andrew Beveridge,et al.  The Best Mixing Time for Random Walks on Trees , 2014, Graphs Comb..

[63]  Roberto Tempo,et al.  Novel Multidimensional Models of Opinion Dynamics in Social Networks , 2015, IEEE Transactions on Automatic Control.

[64]  S. Linden.  Determinants and Measurement of Climate Change Risk Perception, Worry, and Concern , 2017 .

[65]  Ming Cao,et al.  Analysis and applications of spectral properties of grounded Laplacian matrices for directed networks , 2017, Autom..

[66]  Alexander Olshevsky,et al.  Linear Time Average Consensus and Distributed Optimization on Fixed Graphs , 2017, SIAM J. Control. Optim..

[67]  Ming Cao,et al.  Opinion evolution in time-varying social influence networks with prejudiced agents , 2017, ArXiv.

[68]  Roberto Tempo,et al.  A Tutorial on Modeling and Analysis of Dynamic Social Networks. Part II , 2018, Annu. Rev. Control..

[69]  Yuval Peres,et al.  Sensitivity of Mixing Times in Eulerian Digraphs , 2016, SIAM J. Discret. Math..

[70]  Carson C. Chow,et al.  Small Worlds , 2000 .

[71]  L. Asz.  Random Walks on Graphs: a Survey , 2022 .