Majority Dynamics and the Retention of Information
暂无分享,去创建一个
[1] R. Schonmann,et al. Stretched Exponential Fixation in Stochastic Ising Models at Zero Temperature , 2002 .
[2] Ron Holzman,et al. The majority action on infinite graphs: strings and puppets , 2000, Discret. Math..
[3] Elchanan Mossel,et al. Majority dynamics and aggregation of information in social networks , 2012, Autonomous Agents and Multi-Agent Systems.
[4] Convergence in Energy-Lowering (Disordered) Stochastic Spin Systems , 2002, math/0203234.
[5] Clusters and recurrence in the two-dimensional zero-temperature stochastic ising model , 2001, math/0103050.
[6] C. D. Howard,et al. Zero-temperature ising spin dynamics on the homogeneous tree of degree three , 2000, Journal of Applied Probability.
[7] A. Montanari,et al. Majority dynamics on trees and the dynamic cavity method , 2009, 0907.0449.
[8] Eric Goles Ch.,et al. Periodic behaviour of generalized threshold functions , 1980, Discret. Math..
[9] David Peleg,et al. Size Bounds for Dynamic Monopolies , 1998, Discret. Appl. Math..
[10] Glenn Ellison,et al. Rules of Thumb for Social Learning , 1993, Journal of Political Economy.
[11] Douglas Gale,et al. Bayesian learning in social networks , 2003, Games Econ. Behav..
[12] S. Goyal,et al. Learning from neighbours , 1998 .
[13] Eli Berger. Dynamic Monopolies of Constant Size , 2001, J. Comb. Theory, Ser. B.
[14] W S McCulloch,et al. A logical calculus of the ideas immanent in nervous activity , 1990, The Philosophy of Artificial Intelligence.
[15] Elchanan Mossel,et al. Strategic Learning and the Topology of Social Networks , 2012, ArXiv.
[16] G. Moran. ON THE PERIOD-TWO-PROPERTY OF THE MAJORITY OPERATOR IN INFINITE GRAPHS , 1995 .
[17] Johannes Gehrke,et al. Gossip-based computation of aggregate information , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[18] Devavrat Shah,et al. Gossip Algorithms , 2009, Found. Trends Netw..