Abstract
This paper studies the scale of the size of a representative node set in social networks. First, a simple distance-based representative model is proposed. Then, with two small-world like assumptions which are widely observed in large-scale online social networks, it is shown that the size R of such a representative set satisfies an allometric scaling R ∝ n γ, where n is the size of the network and γ is a constant such that 0 ≤ γ < 1. In particular, a theoretical analysis using Dunbar’s Number as the average degree of nodes suggests 1∕3 ≤ γ ≤ 5∕9 for large-scale real social networks. This is the first theoretical model that can explain the phenomenon that the number of congressional representatives scales to the \(\frac {2}{5}\)-th power (i.e., γ = 2∕5) of the population in real world. It also suggests that, in order to represent (or to influence) a majority in a social network, a surprisingly small (sublinear) number of representatives is enough. For instance, the number is a few thousands for Facebook which has more than two billions users. This demonstrates how easy to spread information in social networks.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Change history
11 March 2020
The original version of this chapter was inadvertently published with middle initial of the second author “Tianyi Y. Peng”. The middle initial has been removed as per author’s request and updated as “Tianyi Peng”.
Notes
- 1.
We remark that it is possible to calculate a representative node set with respect to our model for given networks. Detail on the algorithm is omitted due to page limit.
- 2.
We remark that κ can be found in polynomial time. In fact, running breadth-first searches (see [17], Section 10.3.5) for all nodes can find the answer in O(mn + n 2) time [24]. The study [24] used a faster subroutine in [25]. On the other hand, similar to the IM problem, finding λ for a given network and κ ≥ 1 is NP-hard [25].
- 3.
References
Auriol, E., Gary-Bobo, R.J.: On the optimal number of representatives. Public Choice 153(3–4), 419–445 (2012)
Barabasi, A.-L.: Network Science. Cambridge University Press, Cambridge (2016). http://networksciencebook.com/. Accessed 27 Sept 2019
Bhagat, S., Burke, M., Diuk, C., Filiz, I.O., Edunov, S.: Three and a half degrees of separation (2016). https://research.fb.com/three-and-a-half-degrees-of-separation/. Retrieved on April 2019
Brooks, L., Philips, J., Sinitsyn, M.: The cabals of a few or the confusion of a multitude: the institutional trade-off between representation and governance. Am. Econ. J. Econ. Pol. 3, 1–24 (2011)
Clauset, A., Moore, C., Newman, M.E.J.: Hierarchical structure and the prediction of missing links in networks. Nature 453, 98–101 (2008)
CNET News: Sorry, Facebook friends: our brains can’t keep up. https://www.cnet.com/news/sorry-facebook-friends-our-brains-cant-keep-up/. Accessed 15 April 2018
Dunbar, R.I.M.: Neocortex size as a constraint on group size in primates. J. Hum. Evol. 22(6), 469–493 (1992) https://doi.org/10.1016/0047-2484(92)90081-J
Godefroy, R., Klein, N.: Parliament shapes and sizes. Econ. Inq. (2018). https://doi.org/10.1111/ecin.12584
Haynes, T.W.: Stephen Hedetniemi, Peter Slater, Fundamentals of Domination in Graphs. Marcel Dekker, New York (1998)
Inter-Parliamentary Union (IPU): Annual report 2017. https://www.ipu.org/file/4474/download?token=YvWKNbJ3. Retrieved 26 Oct 2018
Jacobs, K., Otjes, S.: Explaining the size of assemblies. A longitudinal analysis of the design and reform of assembly sizes in democracies around the world. Elect. Stud. 40, 280–292 (2015)
Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the Spread of Influence through a Social Network. In: Proceedings of the 9th ACM SIGKDD, pp. 137–146 (2003)
Leskovec, J., Krevl, A.: SNAP datasets: stanford large network dataset collection (2014). http://snap.stanford.edu/data.
Li, Y., Fan, J., Wang, Y., Tan, K.L.: Influence maximization on social graphs: a survey. IEEE Trans. Knowl. Data Eng. 30(10), 1852–1872. https://ink.library.smu.edu.sg/sis_research/3981
Lu, C., Yu, J.X., Li, R.H., Wei, H.: Exploring hierarchies in online social networks. IEEE Trans. Knowl. Data Eng. 28(8), 2086–2100 (2016)
Mones. E., Vicsek, L., Vicsek, T.: Hierarchy measure for complex networks. PLoS One 7(3), e33799 (2012). https://doi.org/10.1371/journal.pone.0033799
Newman, M.E.J.: Network: An Introduction. Oxford Press, Oxford (2010)
Penrose, L.S.: The elementary statistics of majority voting. J. R. Stat. Soc. 109(1), 53–57 (1946)
Ranjbar-Sahraei, B., Bou Ammar, H., Tuyls, K., Weiss, G.: On the prevalence of hierarchies in social networks. Soc. Netw. Anal. Min. 6, 58 (2016)
Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: Proceedings of the 29th AAAI Conference on Artificial Intelligence (2015). http://networkrepository.com
Stigler, G.J.: The Sizes of legislatures. J. Legal Stud. 5(1), 17–34 (1976)
Taagepera, R.: The size of national assemblies. Soc. Sci. Res. 1(4), 385–401 (1972)
Tang, J., Tang, X., Yuan, J.: Influence maximization meets efficiency and effectiveness: a hop-based approach. In: Proceedings of the ASONAM’17, pp. 64-41 (2017)
Zhao, L.: Majority dominating and democratic number: a proposal to define the democracy of a social network. In: Proceedings of the 4th Internatinal Conference on Operations Research and Statistics (ORS 2016), Singapore, pp. 66–67 (2016)
Zhao, L.: Finding small dominating sets in large-scale networks. In: Dehmer, M., et al. Big Data of Complex Networks. Chapman and Hall/CRC, Boca Raton (2016)
Acknowledgement
This research was supported by JSPS KAKENHI Grant Number 18K11182.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Zhao, L., Peng, T. (2020). An Allometric Scaling for the Number of Representative Nodes in Social Networks. In: Masuda, N., Goh, KI., Jia, T., Yamanoi, J., Sayama, H. (eds) Proceedings of NetSci-X 2020: Sixth International Winter School and Conference on Network Science. NetSci-X 2020. Springer Proceedings in Complexity. Springer, Cham. https://doi.org/10.1007/978-3-030-38965-9_4
Download citation
DOI: https://doi.org/10.1007/978-3-030-38965-9_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-38964-2
Online ISBN: 978-3-030-38965-9
eBook Packages: Physics and AstronomyPhysics and Astronomy (R0)