M. Pelegrin, E. Carrizosa, A. Marín

In recent years, community discovery led by key nodes identification has become a hot research topic in network analysis. Since real networks usually display a modular structure, it is commonly assumed that targeted key members will be in different compartments or communities. Recent works identify key nodes in a first step and use them as communities centroids afterwards. However, none of them consider joint optimization of key nodes and communities. This work presents a mathematical programming formulation for identifying the group of most relevant nodes and their spheres of infuence, interpreted as communities. The network clustering
yielding maximum overall relevance of the clusters centroids, calculated as an eigenvector centrality, is selected. The proposed exact approach serves as a suitable adaptation of widespread PageRank to the problem of group centrality. Our computational tests show its potential to uncover complex network structures, in a context where heuristics abound.

Keywords: Network Analysis, Eigenvector centrality, Clustering, Mathematical Optimization


RM-2 Ramiro Melendreras Award
September 3, 2019  6:30 PM
I3L1. Georgina Blanes building

Other papers in the same session

Prediction of air pollutants PM10 by ARBX(1) processes

J. Álvarez Liébana, M. D. Ruiz-Medina

On the Computation of Poisson Probabilities

S. D. Chagaboina, J. A. Carrasco López, V. Suñé Socias

Cookie policy

We use cookies in order to be able to identify and authenticate you on the website. They are necessary for the correct functioning of it, and therefore they can not be disabled. If you continue browsing the website, you are agreeing with their acceptance, as well as our Privacy Policy.

Additionally, we use Google Analytics in order to analyze the website traffic. They also use cookies and you can accept or refuse them with the buttons below.

You can read more details about our Cookie Policy and our Privacy Policy.