Asynchronous Majority Dynamics in Preferential Attachment Trees

We study information aggregation in networks where agents make binary decisions (labeled incorrect or correct). Agents initially form independent private beliefs about the better decision, which is correct with probability $1/2+\delta$. The dynamics we consider are asynchronous (each round, a single agent updates their announced decision) and non-Bayesian (agents simply copy the majority announcements among their neighbors, tie-breaking in favor of their private signal). Our main result proves that when the network is a tree formed according to the preferential attachment model~\cite{BarabasiA99}, with high probability, the process stabilizes in a correct majority. We extend our results to other tree structures, including balanced $M$-ary trees for any $M$.

[1]  S. Matthew Weinberg,et al.  Asynchronous Majority Dynamics in Preferential Attachment Trees , 2019, ICALP.

[2]  Yu-Ping Tian,et al.  Detection Performance of the Majority Dominance Rule in $m$ -Ary Relay Trees With Node and Link Failures , 2018, IEEE Transactions on Signal Processing.

[3]  S. Bikhchandani,et al.  You have printed the following article : A Theory of Fads , Fashion , Custom , and Cultural Change as Informational Cascades , 2007 .

[4]  Elchanan Mossel,et al.  Majority dynamics and aggregation of information in social networks , 2012, Autonomous Agents and Multi-Agent Systems.

[5]  Yashodhan Kanoria,et al.  Subexponential convergence for information aggregation on regular trees , 2011, IEEE Conference on Decision and Control and European Control Conference.

[6]  Elchanan Mossel,et al.  Efficient Bayesian Learning in Social Networks with Gaussian Estimators , 2010, 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

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

[8]  R. Holley,et al.  Ergodic Theorems for Weakly Interacting Infinite Systems and the Voter Model , 1975 .

[9]  Edwin K. P. Chong,et al.  Learning in Hierarchical Social Networks , 2012, IEEE Journal of Selected Topics in Signal Processing.

[10]  Nicolas Vieille,et al.  Informational externalities and emergence of consensus , 2009, Games Econ. Behav..

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

[12]  Nikhil R. Devanur,et al.  Reaching Consensus via Non-Bayesian Asynchronous Learning in Social Networks , 2014, APPROX-RANDOM.

[13]  Vicenç Gómez,et al.  Modeling the structure and evolution of discussion cascades , 2010, HT '11.

[14]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[15]  Omer Tamuz,et al.  Majority Dynamics and the Retention of Information , 2013, 1307.4035.

[16]  Nikolaos Fountoulakis,et al.  Local Majority Dynamics on Preferential Attachment Graphs , 2015, WAW.

[17]  Drew Fudenberg,et al.  Word-of-mouth learning , 2004, Games Econ. Behav..

[18]  S. Janson.  Tail bounds for sums of geometric and exponential variables , 2017, 1709.08157.

[19]  Mohsen Ghaffari,et al.  Nearly-Tight Analysis for 2-Choice and 3-Majority Consensus Dynamics , 2018, PODC.

[20]  Lones Smith,et al.  Pathological Outcomes of Observational Learning , 2000 .

[21]  Béla Bollobás,et al.  The Diameter of a Scale-Free Random Graph , 2004, Comb..

[22]  Merav Parter,et al.  A Polylogarithmic Gossip Algorithm for Plurality Consensus , 2016, PODC.

[23]  C. D. Howard,et al.  Zero-temperature ising spin dynamics on the homogeneous tree of degree three , 2000, Journal of Applied Probability.

[24]  Béla Bollobás,et al.  The degree sequence of a scale‐free random graph process , 2001, Random Struct. Algorithms.

[25]  Matthew O. Jackson,et al.  Naïve Learning in Social Networks and the Wisdom of Crowds , 2010 .

[26]  Yashodhan Kanoria,et al.  Tractable Bayesian Social Learning on Trees , 2012, IEEE Journal on Selected Areas in Communications.

[27]  Remco van der Hofstad,et al.  Diameters in Preferential Attachment Models , 2007, 0705.4153.

[28]  P. Clifford,et al.  A model for spatial conflict , 1973 .

[29]  Elchanan Mossel,et al.  Asymptotic learning on Bayesian social networks , 2012, Probability Theory and Related Fields.

[30]  Boris G. Pittel,et al.  Note on the Heights of Random Recursive Trees and Random m-ary Search Trees , 1994, Random Struct. Algorithms.

[31]  A. Banerjee,et al.  A Simple Model of Herd Behavior , 1992 .

[32]  Luca Trevisan,et al.  Stabilizing Consensus with Many Opinions , 2015, SODA.

[33]  SpencerJoel,et al.  The degree sequence of a scale-free random graph process , 2001 .

[34]  Manuel Mueller-Frank,et al.  A general framework for rational learning in social networks , 2011 .

[35]  A. Montanari,et al.  Majority dynamics on trees and the dynamic cavity method , 2009, 0907.0449.