A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Monte-Carlo Methods for Social Network Analysis
사회네트워크분석에서 몬테칼로 방법의 활용
2011
Korean Journal of Applied Statistics
사회네트워크분석에서 몬테칼로 방법의 활용
Preserved Fulltext
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
doi:10.5351/kjas.2011.24.2.401
fatcat:i727zorxkfhn5i2rervh7kctre