Skip to main content
back to events

Degeneracy based community evaluation

Speaker:*Postponed* Michalis Vazirgiannis


University:Dept of Informatics, Athens Univ. of Economics & Business

Room :A56

Time:4:00pm (coffee: 3:30)


Graphs constitute the dominant data structure in the WWW, and appear essentially in all forms of information. Examples are the web graph, social networks, protein interaction networks, terms dependency graphs etc. Important knowledge is hidden in the macroscopic topology and features of these graphs.

The dominant knowledge artifacts extracted from graphs are either individual node based scores (such as authority/hubness/centrality) or unsupervised grouping of nodes in to clusters or global statistics computations (such as degree distributions etc). What is missing is metrics, structures and measures that represent the deeper knowledge hidden in the macroscopic structure of potentially directed/weighted graphs.

We propose new metrics and evaluation schemes for the macroscopic structure of graphs capitalizing on the degeneracy concept, i.e. k-cores, towards identifying the most cohesive components of graphs – finding thus the most collaborative constituents. These metrics compute the most robust subgraphs representing dense and mutual connectivity in the case of directed and weighted graphs as well. Connectivity can be then interpreted in several ways: i.e. as collaboration in citation or social networking graphs, collective affinity in protein interaction graphs etc. We also use the best k-cores of graphs as seeds for optimizing the speed of spectral graph clustering. We conducted several experiments on real (DBLP, Wikipedia) and synthetic data sets. The results are interesting especially in the case in the DBLP citation graph.

We further extend k-core to deal with directed graphs, introducing the D-core concept, as means of evaluating a digraph’s collaborative nature. Based on the D-core we devise a wealth of novel metrics used to evaluate the graphs collaboration features. We applied the above approaches on large real world graphs - Wikipedia and DBLP - and report interesting results.

A relevant prototype demo is available at:

Related websites
No related websites
Related organizations
No related organizations