Other Articles by Authors

Yinghong Ma
Wenqian Wang

Authors and WSEAS

Yinghong Ma
Wenqian Wang

WSEAS Transactions on Mathematics

Print ISSN: 1109-2769
E-ISSN: 2224-2880

Volume 17, 2018

Notice: As of 2014 and for the forthcoming years, the publication frequency/periodicity of WSEAS Journals is adapted to the 'continuously updated' model. What this means is that instead of being separated into issues, new papers will be added on a continuous basis, allowing a more regular flow and shorter publication times. The papers will appear in reverse order, therefore the most recent one will be on top.

Volume 17, 2018

Weighted Modularity on k-Path Graph

AUTHORS: Yinghong Ma, Wenqian Wang

Download as PDF

ABSTRACT: This Community detection is one of the most interesting problems in the study of social networks. Most of the recent studies focused on how to design algorithms to find the communities without knowing the number of communities in advance. In this paper, we define the k path graph, and generalize Newman s modularity as weighted modularity. It is also highlight the relationship between eigenvalues and the number of communities of social networks in this paper

KEYWORDS: Social network, -path graph, modularity, community detection


[1] S. Milgram, The Small World Problem, Psychol. Today, Vol. 2, pp:60-67, 1967.

[2] J. Guare, Six Degrees of Separation, Vintage, New York, 1990.

[3] M. E. J. Newman, Modularity and community structure in networks, Proc. Natl. Acad. Sci., Vol. 103(23), pp:8577-8581, 2006.

[4] M. Girvan and M. E. J. Newman, Community structure in social and biological networks, Proc. Natl. Acad. Sci. Vol. 99, pp:7821-7826, 2002.

[5] M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory ofNP Completeness, Freeman, San Francisco, 1979.

[6] J. Scott, Social Network Analysis: A Handbook, 2nd Edition, Sage Publications, London, 2000.

[7] B. W. Kernighan and S. Lin, A e fficient heuristic procedure for partitioning graphs, Bell System Technical Journal, Vol. 49, pp:291-307, 1970.

[8] A. Pothen, H. Simon and K. P. Liou, Partitioning sparse matrices with eigenvectors of graphs, SIAM J. Matrix Anal. Appl., Vol. 11, pp:430-439, 1990.

[9] M. E. J. Newman. Fast algorithm for detecting community structure in networks, Phys. Rev. E, Vol. 69, 066133, 2004.

[10] F. Radicchi, C. Castellano and F. Cecconi. De fining and identifying communities in networks, Proc. Natl. Acad. Sci., Vol. 101, pp:2658-2663, 2004.

[11] M. Latapy and P. Pons, Computing communities in large networks using random walks, in Proceedings of the 20th International Symposium on Computer and Information Sciences, Lecture Notes in Computer Science, Vol. 3733, pp:284-293, 2005.

[12] M. E. J. Newman. Finding community structure in networks using the eigenvectors of matrices. PHYSICAL REVIEW E.Vol.74, 036104,pp:1 19(2006).

WSEAS Transactions on Mathematics, ISSN / E-ISSN: 1109-2769 / 2224-2880, Volume 17, 2018, Art. #17, pp. 126-129

Copyright © 2018 Author(s) retain the copyright of this article. This article is published under the terms of the Creative Commons Attribution License 4.0

Bulletin Board


The editorial board is accepting papers.

WSEAS Main Site