Estimating Network Memberships by Simplex Vertices Hunting


Consider an undirected mixed membership network with n nodes and K communities. For each node i, 1 ≤ i ≤ n, we model the membership by a Probability Mass Function (PMF) πi = (πi(1), πi(2), . . ., πi(K)) ′, where πi(k) is the probability that node i belongs to community k, 1 ≤ k ≤ K. We call node i “pure” if πi is degenerate and “mixed” otherwise. The… (More)


13 Figures and Tables

Cite this paper

@inproceedings{Jin2016EstimatingNM, title={Estimating Network Memberships by Simplex Vertices Hunting}, author={By Jiashun Jin and Zheng Tracy Ke and Shengming Luo}, year={2016} }