Abstract
Information cascades have been studied in the literature where myopic selfish users sequentially appear and make a decision to buy a product based on their private observation about the value of the product and actions of their predecessors. Bikhchandani et. al (1992) and Banerjee (1992) introduced such a model and showed that after a finite time, almost surely, users discard their private information and herd on an action asymptotically. In this paper, we study a generalization of that model where we assume users are connected through a random tree, which locally acts as an approximation for Erdös–Rényi random graph when the degree distribution of each vertex of the tree is binomial and as the number of nodes grows large. We show that informational cascades on such tree-structured networks may be analyzed by studying the extinction probability of a certain branching process. We use the theory of multi-type Galton–Watson branching process and calculate the probability of the tree network falling into a cascade. More specifically, we find conditions when this probability is strictly smaller than 1 that are in terms of the degree distributions of the vertices in the tree. Our results indicate that groups that are less tightly knit, i.e., have lesser connection probability (and as a result have lesser diversity of thought), tend to herd more than the groups that have more social connections.
Supported in part by Department of Defense grant W911NF1510225 and Simon’s Foundation grant 26-7523-99.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Erdös–Rényi random graph with parameter p is defined as an undirected random graph where each pair of vertices is connected independently with probability p.
- 2.
This assumption excludes the possibility the tree goes extinct due to lack of child and thus implies that probability of extinction is the same as probability of a cascade (as justified later).
- 3.
- 4.
Note that in the case of more than two actions, there will be corresponding number of types of children.
References
Acemoglu, D., Dahleh, M.A., Lobel, I., Ozdaglar, A.: Bayesian learning in social networks. The Review of Economic Studies 78(4), 1201–1236 (2011)
Acemoglu, D., Makhdoumi, A., Malekian, A., Ozdaglar, A.: Fast and slow learning from reviews. Tech. rep., National Bureau of Economic Research (2017)
Banerjee, A.V.: A simple model of herd behavior. The Quarterly Journal of Economics pp. 797–817 (1992)
Bikhchandani, S., Hirshleifer, D., Welch, I.: A theory of fads, fashion, custom, and cultural change as informational cascades. Journal of Political Economy 100(5), pp. 992–1026 (1992), http://www.jstor.org/stable/2138632
Bubeck, S., Devroye, L., Lugosi, G.: Finding adam in random growing trees. Random Structures & Algorithms 50(2), 158–172 (2017)
Clauset, A., Newman, M.E., Moore, C.: Finding community structure in very large networks. Physical review E 70(6), 066111 (2004)
Dhounchak, R., Kavitha, V., Altman, E.: A viral timeline branching process to study a social network. arXiv preprint arXiv:1705.09828 (2017)
Fanti, G., Kairouz, P., Oh, S., Ramchandran, K., Viswanath, P.: Hiding the rumor source. IEEE Transactions on Information Theory (2017)
Fudenberg, D., Tirole, J.: Perfect bayesian equilibrium and sequential equilibrium. journal of Economic Theory 53(2), 236–260 (1991)
Harel, M., Mossel, E., Strack, P., Tamuz, O.: The speed of social learning. arXiv preprint arXiv:1412.7172 (2014)
Harris, T.E.: The theory of branching processes. Courier Corporation (2002)
Jackson, M.O.: Social and economic networks. Princeton university press (2010)
Kempe, D., Kleinberg, J., Tardos, É.: Maximizing the spread of influence through a social network. In: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining. pp. 137–146. ACM (2003)
Kendall, D.G.: Branching processes since 1873. Journal of the London Mathematical Society 1(1), 385–406 (1966)
Le, T.N., Subramanian, V., Berry, R.: The impact of observation and action errors on informational cascades. In: Decision and Control (CDC), 2014 IEEE 53rd Annual Conference on. pp. 1917–1922 (Dec 2014). https://doi.org/10.1109/CDC.2014.7039678
Moyal, J.: Multiplicative population chains. In: Proceedings of the Royal Society of London A: Mathematical, Physical and Engineering Sciences. vol. 266, pp. 518–526. The Royal Society (1962)
Newman, M.: Networks: an introduction. Oxford university press (2010)
Peres, Y., Racz, M.Z., Sly, A., Stuhl, I.: How fragile are information cascades? arXiv preprint arXiv:1711.04024 (2017)
Shah, D., Zaman, T.: Rumors in a network: Who’s the culprit? IEEE Transactions on information theory 57(8), 5163–5181 (2011)
Smith, L., Sörensen, P.: Pathological outcomes of observational learning. Econometrica 68(2), 371–398 (2000). https://doi.org/10.1111/1468-0262.00113
Vasal, D., Anastasopoulos, A.: Decentralized Bayesian learning in dynamic games. In: Allerton Conference on Communication, Control, and Computing (2016), https://arxiv.org/abs/1607.06847
Vasal, D., Subramanian, V., Anastasopoulos, A.: Incentive design for learning in user-recommendation systems with time-varying states. In: 2015 49th Asilomar Conference on Signals, Systems and Computers. pp. 1080–1084 (Nov 2015). https://doi.org/10.1109/ACSSC.2015.7421305
Acknowledgements
The author would like to thank Varun Jog for interesting discussions and anonymous reviewers for the feedback.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Appendices
Appendix A
Proof
where \(\left( \frac{Q(\cdot |V=1)}{Q(\cdot |V=0)}\right) \) inverse exists since it is non-decreasing as implied the monotone likelihood assumption, and \(F_X^v(a) := P(X\le a|V=v)\).
Appendix B
Proof
Under the equilibrium policy g defined in (8), belief \(\pi _t^k\) can be updated using Bayes’ rule as follows.
Appendix C
Proof
Thus,
Appendix D
Let \(f(y) = p\phi _D(p+ \bar{p}\phi _D(y))+ \bar{p}\phi _D(p\phi _D(y)+ \bar{p}).\) It is shown in Appendix E that f(y) is monotonically increasing and strictly convex for \(y>0\).
Since \( f(0) = p (\phi _D(p))+ \bar{p}\phi _D(\bar{p} ) > 0\) and f(y) is monotonically increasing and strictly convex, there exists another fixed point of \(f(y) = y\) in the range (0, 1) if and only if \(\frac{d}{dy} f(y) \mid _{y=1}>1\). The smallest fixed point is stable since the derivative of f(y) is less than 1 at that point, and thus by Theorem 1, it represents the probability of cascading. The derivative of f(y) at \(y=1\) is given by,
Thus, the tree cascades with probability 1 if and only if \(2p\bar{p}(\phi _D^{'}(1))^2\le 1\), i.e., \(\phi _D^{'}(1)=\mathbb {E}[D]\le \frac{1}{\sqrt{2p\bar{p}}}\). Otherwise the tree cascades with a nonzero probability which is the smallest fixed point of \(f(y)=y\).
Appendix E
Lemma 4
\(f(y)=p\phi _D(p+ \bar{p}\phi _D(y))+ \bar{p}\phi _D(p\phi _D(y)+ \bar{p})\) is monotonically increasing and strictly convex for \(y>0\).
Proof
We will show that \(p\phi _D(p+ \bar{p}\phi _D(y)) \) is strictly increasing and convex, and the proof of the other part is identical.
where the last inequality is true since \(\phi _D(y) = \mathbb {E}[y^D]>0\) and \(\frac{d}{dy} \phi _D(y) = \mathbb {E}[Dy^{D-1}]>0\) since \(y>0\) and \(D\ge 1\) a.s..
where the last inequality is true by similar arguments as before.
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Vasal, D. (2019). Impact of Social Connectivity on Herding Behavior. In: Walrand, J., Zhu, Q., Hayel, Y., Jimenez, T. (eds) Network Games, Control, and Optimization. Static & Dynamic Game Theory: Foundations & Applications. Birkhäuser, Cham. https://doi.org/10.1007/978-3-030-10880-9_12
Download citation
DOI: https://doi.org/10.1007/978-3-030-10880-9_12
Published:
Publisher Name: Birkhäuser, Cham
Print ISBN: 978-3-030-10879-3
Online ISBN: 978-3-030-10880-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)