Modeling of growing networks with communities
Tóm tắt
We propose a growing network model and its learning algorithm. Unlike the conventional scale-free models, we incorporate community structure, which is an important characteristic of many real-world networks including the Web. In our experiments, we confirmed that the proposed model exhibits a degree distribution with a power-law tail, and our method can precisely estimate the probability of a new link creation from data without community information. Moreover, by introducing a measure of dynamic hub-degrees, we could predict the change of hub-degrees between communities.
Từ khóa
#Probability distribution #Tail #Laboratories #Graph theory #Stochastic processesTài liệu tham khảo
cohn, 2000, Learning to probabilistically identify authoritative documents, Proceedings of the 17th International Conference on Machine Learning, 167
10.1016/S1389-1286(00)00083-9
10.1103/PhysRevLett.86.5401
10.1145/347090.347121
10.1073/pnas.032085699
cohn, 2001, The missing link - A probabilistic model of document content and hypertext connectivity, Advances in Neural Information Processing Systems 13, 430
10.1038/35065725
kleinberg, 1998, Authoritative sources in a hyperlinked environment, Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms, 668
10.1073/pnas.122653799
barabas, 1999, Emergence of scaling in random networks, Science, 286, 509, 10.1126/science.286.5439.509
kleinberg, 2001, The structure of the Web, Science, 294, 1849, 10.1126/science.1067014
10.1103/RevModPhys.74.47