Combinatorial Miller–Hagberg Algorithm for Randomization of Dense Networks
We propose a slightly revised Miller–Hagberg (MH) algorithm that efficiently generates a random network from a given expected degree sequence. The revision was to replace the approximated edge probability between a pair of nodes with a combinatorically calculated edge probability that better captures the likelihood of edge presence especially, where edges are dense. The computational complexity of this combinatorial MH algorithm is still in the same order as the original one. We evaluated the proposed algorithm through several numerical experiments. The results demonstrated that the proposed algorithm was particularly good at accurately representing high-degree nodes in dense, heterogeneous networks. This algorithm may be a useful alternative to other more established network randomization methods, given that the data are increasingly becoming larger and denser in today’s network science research.
- 5.Miller, J., Hagberg, A.: Efficient generation of networks with given expected degrees. Algorithms and Models for the Web Graph (WAW 2011), pp. 115–126. Springer, Berlin (2011)Google Scholar
- 10.Leskovec, J., McAuley, J.J.: Learning to discover social circles in ego networks. In: Advances in Neural Information Processing Systems, pp. 539–547 (2012)Google Scholar
- 13.Zamani Esfahlani, F., Sayama, H.: A percolation-based thresholding method with applications in functional connectivity analysis (submitted to CompleNet 2018, under review)Google Scholar
- 14.Zachary, W.W.: An information flow model for conflict and fission in small groups. J. Anthr. Res. 33(4), 452–473 (1977)Google Scholar