# Assessing Vertex Relevance based on Community Detection

### Paul Parau, Camelia Lemnaru, Rodica Potolea

#### Abstract

The community structure of a network conveys information about the network as a whole, but it can also provide insightful information about the individual vertices. Identifying the most relevant vertices in a network can prove to be useful, especially in large networks. In this paper, we explore different alternatives for assessing the relevance of a vertex based on the community structure of the network. We distinguish between two relevant vertex properties - commitment and importance - and propose a new measure for quantifying commitment, Relative Commitment. We also propose a strategy for estimating the importance of a vertex, based on observing the disruption caused by removing it from the network. Ultimately, we propose a vertex classification strategy based on commitment and importance, and discuss the aspects covered by each of the two properties in capturing the relevance of a vertex.

#### References

- Albert, R., Jeong, H., and Barabasi, A. L. (2000). Error and attack tolerance of complex networks. Nature, 406(6794):378-382.
- Fortunato, S. (2010). Community detection in graphs. Physics Reports, 486(3-5):75-174.
- Fortunato, S. and Castellano, C. (2008). Community structure in graphs. In Encyclopedia of Complexity and Systems Science, pages 1141-1163.
- Guimera, R. and Amaral, L. A. N. (2005). Cartography of complex networks: modules and universal roles. Journal of Statistical Mechanics: Theory and Experiment, 2005(P02001):P02001-1-P02001-13.
- Karrer, B., Levina, E., and Newman, M. E. J. (2008). Robustness of community structure in networks. Phys. Rev. E, 77:046119.
- Lancichinetti, A. and Fortunato, S. (2009). Community detection algorithms: a comparative analysis. Phys. Rev. E, 80:056117.
- Lancichinetti, A., Kivela, M., Saramaki, J., and Fortunato, S. (2010). Characterizing the community structure of complex networks. CoRR, abs/1005.4376.
- Newman, M. E. J. (2003). The structure and function of complex networks. SIAM Review, 45:167-256.
- Newman, M. E. J. (2004). Fast algorithm for detecting community structure in networks. Phys. Rev. E, 69:066133.
- Newman, M. E. J. (2006). Finding community structure in networks using the eigenvectors of matrices. Physical review E, 74(3).
- Orman, G. K., Labatut, V., and Cherifi, H. (2012). Comparative evaluation of community detection algorithms: A topological approach. Journal of Statistical Mechanics: Theory and Experiment, P08001.
- Palla, G., Barabasi, A. L., and Vicsek, T. (2007). Quantifying social group evolution. Nature, 446(7136):664- 667.
- Rosvall, M. and Bergstrom, C. T. (2008). Maps of random walks on complex networks reveal community structure. Proceedings of the National Academy of Sciences, 105(4):1118-1123.
- Rosvall, M. and Bergstrom, C. T. (2010). Mapping change in large networks. PLoS ONE, 5(1):e8694.
- Zachary, W. W. (1977). An information flow model for conflict and fission in small groups. Journal of Anthropological Research, 33:452-473.

#### Paper Citation

#### in Harvard Style

Parau P., Lemnaru C. and Potolea R. (2015). **Assessing Vertex Relevance based on Community Detection** . In *Proceedings of the 7th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management - Volume 1: KDIR, (IC3K 2015)* ISBN 978-989-758-158-8, pages 46-56. DOI: 10.5220/0005596300460056

#### in Bibtex Style

@conference{kdir15,

author={Paul Parau and Camelia Lemnaru and Rodica Potolea},

title={Assessing Vertex Relevance based on Community Detection},

booktitle={Proceedings of the 7th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management - Volume 1: KDIR, (IC3K 2015)},

year={2015},

pages={46-56},

publisher={SciTePress},

organization={INSTICC},

doi={10.5220/0005596300460056},

isbn={978-989-758-158-8},

}

#### in EndNote Style

TY - CONF

JO - Proceedings of the 7th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management - Volume 1: KDIR, (IC3K 2015)

TI - Assessing Vertex Relevance based on Community Detection

SN - 978-989-758-158-8

AU - Parau P.

AU - Lemnaru C.

AU - Potolea R.

PY - 2015

SP - 46

EP - 56

DO - 10.5220/0005596300460056