Computing the Value of a Crowd
This paper proposes that the “value” of a crowd can be defined in terms of the overall engagement of the individuals within the crowd and that engagement is a function of certain characteristics of the crowds such as small world-ness, sparsity and connectedness. Engagement is hypothesized as messages being exchanged over the complex network which represents the crowd and the “value” is calculated from the entropy of message probability distributions. An initial random network is passed through a process of entropy maximization and the values of some structural properties are recorded with the changing topology to study the corresponding behavior. We show that as the small world-ness and connectedness of a crowd increases and the sparsity decreases, the engagement in the crowd increases.
KeywordsAdjacency Matrix Cluster Coefficient Small World Giant Component Average Short Path
Unable to display preview. Download preview PDF.
- 2.Caren, N., Gaby, S.: Occupy Online: Facebook and the Spread of Occupy Wall Street (October 24, 2011), SSRN: http://ssrn.com/abstract=1943168
- 4.Surowiecki, J.: The Wisdom of Crowds: Why the Many Are Smarter Than the Few and How Collective Wisdom Shapes Business, Economies, Societies and Nations. Brown Publishing (2004)Google Scholar
- 5.Borge-Holthoefer, J., Rivero, A., García, I.: Structural and Dynamical Patterns on Online Social Networks: The Spanish May 15th Movement as a Case Study. PLOSOne (August 19, 2011)Google Scholar
- 8.Cancho, R.F.I., Sole, R.: Optimization in Complex Networks. Lect. Notes Phys., vol. 625, pp. 114–125 (2003)Google Scholar
- 9.Sole, R.V., Valverde, S.: Information Theory of Complex Networks: On Evolution and Architectural Constraints. Lect. Notes Phys., vol. 650, pp. 189–207 (2004)Google Scholar