Probabilistic framework for network partition
Probabilistic framework for network partition
复制标题
网络分区的概率框架
DOI：
10.1103/physreve.80.026106
复制
发表时间：
2009-08-01
影响因子：
2.4
通讯作者：
E, Weinan
中科院分区：
文献类型：
--
作者：
Li, Tiejun;Liu, Jian;E, Weinan
Given a large and complex network, we would like to find the partition of this network into a small number of clusters. This question has been addressed in many different ways. In a previous paper, we proposed a deterministic framework for an optimal partition of a network as well as the associated algorithms. In this paper, we extend this framework to a probabilistic setting, in which each node has a certain probability of belonging to a certain cluster. Two classes of numerical algorithms for such a probabilistic network partition are presented and tested. Application to three representative examples is discussed.
