JOURNAL BROWSE
Search
Advanced SearchSearch Tips
Monte-Carlo Methods for Social Network Analysis
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
Monte-Carlo Methods for Social Network Analysis
Huh, Myung-Hoe; Lee, Yong-Goo;
  PDF(new window)
 Abstract
From a social network of n nodes connected by l lines, one may produce centrality measures such as closeness, betweenness and so on. In the past, the magnitude of n was around 1,000 or 10,000 at most. Nowadays, some networks have 10,000, 100,000 or even more than that. Thus, the scalability issue needs the attention of researchers. In this short paper, we explore random networks of the size around n = 100,000 by Monte-Carlo method and propose Monte-Carlo algorithms of computing closeness and betweenness centrality measures to study the small world properties of social networks.
 Keywords
Social network analysis;closeness centrality;betweenness centrality;small world;data scalability;Monte Carlo method;
 Language
Korean
 Cited by
1.
사회 네크워크 분석으로 본 수강신청 행태,임성민;김진흠;

응용통계연구, 2013. vol.26. 4, pp.661-674 crossref(new window)
1.
Investigating the Behavior of College Students in Class Registration using Social Network Analysis, Korean Journal of Applied Statistics, 2013, 26, 4, 661  crossref(new windwow)
 References
1.
허명회 (2010). , 자유아카데미, 서울.

2.
Travers, J. and Milgram, S. (1969). An experimental study of the small world problem, Sociometry, 32, 425-443. crossref(new window)

3.
Wasserman, S. and Faust, K. (1994). Social Network Analysis: Methods and Applications, Cambrdge University Press.

4.
Zachary, W. (1977). An information flow model for conflict and fission in small groups, Journal of Anthropological Research, 33, 452-473.