Before revision:  In particular, we identify a geometric "egalitarianism" condition on the social network graph that guarantees learning in infinite networks, or learning with high probability in large finite networks, in any equilibrium of the game. We give examples of non-egalitarian networks with equilibria in which learning fails.
After revision:  In particular, we identify a geometric "egalitarianism" condition on the social network graph that guarantees learning in infinite networks, or learning with high probability in large finite networks, in any equilibrium . We also give examples of non-egalitarian networks with equilibria in which learning fails.