Abstract
This paper presents an academic web community, MathOverflow, as a network. Social network analysis is used to examine the interactions among users over a period of two and a half years.We describe relevant aspects associated with its behaviour as a result of the dynamics arisen from users participation and contribution, such as the existence of clusters, rich–club and collaborative properties within the network.We examine, in particular, the relationship between the social achievements obtained by users and node centrality derived from interactions through posting questions, answers and comments. Our study shows that the two aspects have a strong direct correlation; and active participation in the forum seems to be the most effective way to gain social recognition.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Rodrigues, E., Milic-Frayling, N., Fortuna, B.: Social tagging behaviour in community-driven question answering. In: IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology, WI-IAT 2008, vol. 1, pp. 112–119. IEEE (2008)
Mendes Rodrigues, E., Milic-Frayling, N.: Socializing or knowledge sharing?: characterizing social intent in community question answering. In: Proceedings of the 18th ACM Conference on Information and Knowledge Management, pp. 1127–1136. ACM (2009)
Tausczik, Y., Pennebaker, J.: Predicting the perceived quality of online mathematics contributions from users’ reputations. In: Proceedings of the 2011 Annual Conference on Human Factors in Computing Systems, pp. 1885–1888. ACM (2011)
Burel, G., He, Y., Alani, H.: Automatic identification of best answers in online enquiry communities. The Semantic Web: Research and Applications, 514–529 (2012)
Tausczik, Y., Pennebaker, J.: Participation in an online mathematics community: differentiating motivations to add. In: Proceedings of the ACM 2012 Conference on Computer Supported Cooperative Work, pp. 207–216. ACM (2012)
Joel, S.: Cultural anthropology of stack exchange. Hacker News London Meetup - Events (June 2012), http://vimeo.com/37309773
MathOverflow: Dumps files (April 1, 2012), http://dumps.mathoverflow.net
Newman, M.: The mathematics of networks. Electronic Article (2005), http://www-personal.umich.edu/~mejn/papers/palgrave.pdf
Newman, M.: The structure of scientific collaboration networks. Proceedings of the National Academy of Sciences 98(2), 404–409 (2001)
Newman, M.: The structure and function of complex networks. SIAM Review 45(2), 167–256 (2003)
Faust, K.: Comparing social networks: size, density, and local structure. Metodološki zvezki 3(2), 185–216 (2006)
Pastor-Satorras, R., Vázquez, A., Vespignani, A.: Dynamical and correlation properties of the internet. Physical Review Letters 87(25), 258701 (2001)
Latora, V., Marchiori, M.: Efficient behavior of small-world networks. Physical Review Letters 87(19), 198701 (2001)
Zhou, S., Mondragón, R.J.: The rich-club phenomenon in the internet topology. IEEE Communications Letters 8(3), 180–182 (2004)
Colizza, V., Flammini, A., Serrano, M., Vespignani, A.: Detecting rich-club ordering in complex networks. Nature Physics 2(2), 110–115 (2006)
Jiang, Z., Zhou, W.: Statistical significance of the rich-club phenomenon in complex networks. New Journal of Physics 10(4), 043002 (2008)
Xu, X., Zhang, J., Small, M.: Rich-club connectivity dominates assortativity and transitivity of complex networks. Physical Review E 82(4), 046117 (2010)
MathOverflow: Mathoverflow - frequently asked questions. Forum web page (July 2012), http://mathoverflow.net/faq
Wasserman, S., Faust, K.: Social network analysis: Methods and applications, vol. 8. Cambridge University Press (1994)
Owen, A., Petrie, M., Palipana, A., Green, D., Croft, T., Jones, A., Joiner, S.: Spearman’s correlation. Loughborough University (2012), http://www.statstutor.ac.uk/resources/uploaded/spearmans.pdf
s.n.: Ib geography notes. Web page (2012), http://www.angelfire.com/ga2/ibgeography/
Hossain, L., Wu, A.: Communications network centrality correlates to organisational coordination. International Journal of Project Management 27(8), 795–811 (2009)
Lund, A., Lund, M.: Spearman’s rank-order correlation. Web page (2012), https://statistics.laerd.com/statistical-guides/spearmans-rank-order-correlation-statistical-guide.php
Zar, J.: Significance testing of the spearman rank correlation coefficient. Journal of the American Statistical Association 67(339), 578–580 (1972)
Tan, P., Steinbach, M., Kumar, V.: Introduction to data mining. Pearson Addison Wesley (2006)
Clauset, A., Newman, M., Moore, C.: Finding community structure in very large networks. Physical Review E 70(6), 066111 (2004)
Newman, M.: Fast algorithm for detecting community structure in networks. Physical Review E 69(6), 066133 (2004)
Xu, G., Zhang, Y., Li, L.: Web Mining and Social Networking: Techniques and Applications, vol. 6. Springer (2010)
Foundation, S.M.R.: Nodexl excel template. Computer Program (2012), http://www.smrfoundation.org/nodexl/
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Montoya, L.V., Ma, A., Mondragón, R.J. (2013). Social Achievement and Centrality in MathOverflow. In: Ghoshal, G., Poncela-Casasnovas, J., Tolksdorf, R. (eds) Complex Networks IV. Studies in Computational Intelligence, vol 476. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36844-8_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-36844-8_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36843-1
Online ISBN: 978-3-642-36844-8
eBook Packages: EngineeringEngineering (R0)