Manufacturing consent

A scheme for consensus formation is considered wherein the value of a certain variable associated with the nodes of a network is fixed a priori for a prescribed set of K nodes, and allowed to propagate throughout the network through an averaging process that mimics a gossip algorithm. The objective is to find the best choice of these K nodes that will achieve the fastest convergence to consensus. This objective is captured by the Perron-Frobenius eigenvalue of the resultant sub-stochastic matrix, which then is the quantity one seeks to minimize. We propose an algorithm for this optimization problem, as well as a greedy scheme with some performance guarantees for a variant of the problem that seeks to minimize a simpler objective. Some other related formulations are also considered.

[1]  J. French.  A formal theory of social power. , 1956, Psychology Review.

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

[3]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.

[4]  E. Seneta,et al.  Towards consensus: some convergence theorems on repeated averaging , 1977, Journal of Applied Probability.

[5]  M. L. Fisher,et al.  An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..

[6]  M. Hirsch.  Systems of Differential Equations that are Competitive or Cooperative II: Convergence Almost Everywhere , 1985 .

[7]  E. Barron,et al.  The Pontryagin maximum principle from dynamic programming and viscosity solutions to first-order partial differential equations , 1986 .

[8]  R. Dykstra,et al.  A Method for Finding Projections onto the Intersection of Convex Sets in Hilbert Spaces , 1986 .

[9]  Shih-Ping Han,et al.  A successive projection method , 1988, Math. Program..

[10]  Noam Chomsky,et al.  Manufacturing Consent , 1988, Power and Inequality.

[11]  Morris W. Hirsch,et al.  Convergent activation dynamics in continuous time networks , 1989, Neural Networks.

[12]  T. Taniguchi.  Stability theorems of perturbed linear ordinary differential equations , 1990 .

[13]  V. Borkar.  Topics in controlled Markov chains , 1991 .

[14]  B. Latané,et al.  Statistical mechanics of social impact. , 1992, Physical review. A, Atomic, molecular, and optical physics.

[15]  X. Zhou.  Verification Theorems within the Framework of Viscosity Solutions , 1993 .

[16]  Gene H. Golub,et al.  Matrix computations (3rd ed.) , 1996 .

[17]  R. Sundaram.  A First Course in Optimization Theory: Optimization in ℝ n , 1996 .

[18]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[19]  M. KleinbergJon.  Authoritative sources in a hyperlinked environment , 1999 .

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

[21]  Frank McSherry,et al.  Spectral partitioning of random graphs , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[22]  P. DeMarzo,et al.  Persuasion Bias, Social Influence, and Uni-Dimensional Opinions , 2001 .

[23]  Vivek S. Borkar,et al.  Convex Analytic Methods in Markov Decision Processes , 2002 .

[24]  I. Chueshov.  Monotone Random Systems Theory and Applications , 2002 .

[25]  Sean P. Meyn,et al.  Risk-Sensitive Optimal Control for Markov Decision Processes with Monotone Cost , 2002, Math. Oper. Res..

[26]  P. DeMarzo,et al.  Persuasion Bias, Social Influence, and Uni-Dimensional Opinions , 2001 .

[27]  N. Maculan,et al.  An O(n) Algorithm for Projecting a Vector on the Intersection of a Hyperplane and a Box in Rn , 2003 .

[28]  Stephen P. Boyd,et al.  Fastest Mixing Markov Chain on a Graph , 2004, SIAM Rev..

[29]  M. K. Ghosh,et al.  Differential games of fixed duration in the framework of relaxed strategies , 2005 .

[30]  M. Newman,et al.  Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[31]  Jan Lorenz,et al.  Continuous Opinion Dynamics under Bounded Confidence: A Survey , 2007, 0707.1762.

[32]  Felipe Cucker,et al.  Emergent Behavior in Flocks , 2007, IEEE Transactions on Automatic Control.

[33]  Chai Wah Wu,et al.  Synchronization in Complex Networks of Nonlinear Dynamical Systems , 2008 .

[34]  V. Borkar.  Stochastic Approximation: A Dynamical Systems Viewpoint , 2008 .

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

[36]  Lev Muchnik,et al.  Identifying influential spreaders in complex networks , 2010, 1001.5285.

[37]  Asuman E. Ozdaglar,et al.  Opinion Dynamics and Learning in Social Networks , 2010, Dyn. Games Appl..

[38]  Robert H. Halstead,et al.  Matrix Computations , 2011, Encyclopedia of Parallel Computing.

[39]  Vivek S. Borkar,et al.  Controlled gossip , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[40]  L. Stanca,et al.  Influential Listeners: An Experiment on Persuasion Bias In Social Networks , 2010 .

[41]  Arun G. Chandrasekhar,et al.  TESTING MODELS OF SOCIAL LEARNING ON NETWORKS : EVIDENCE FROM A FRAMED FIELD EXPERIMENT , 2012 .