D-cores: measuring collaboration of directed graphs based on degeneracy

Community detection and evaluation is an important task in graph mining. In many cases, a community is defined as a subgraph characterized by dense connections or interactions between its nodes. A variety of measures are proposed to evaluate different quality aspects of such communities—in most cases ignoring the directed nature of edges. In this paper, we introduce novel metrics for evaluating the collaborative nature of directed graphs—a property not captured by the single node metrics or by other established community evaluation metrics. In order to accomplish this objective, we capitalize on the concept of graph degeneracy and define a novel D-core framework, extending the classic graph-theoretic notion of k-cores for undirected graphs to directed ones. Based on the D-core, which essentially can be seen as a measure of the robustness of a community under degeneracy, we devise a wealth of novel metrics used to evaluate graph collaboration features of directed graphs. We applied the D-core approach on large synthetic and real-world graphs such as Wikipedia, DBLP, and ArXiv and report interesting results at the graph as well at the node level.

[1]  Dimitrios M. Thilikos,et al.  Evaluating Cooperation in Communities with the k-Core Structure , 2011, 2011 International Conference on Advances in Social Networks Analysis and Mining.

[2]  Eli Upfal,et al.  Stochastic models for the Web graph , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[3]  Mihaela Enachescu,et al.  Variations on Random Graph Models for the Web , 2001 .

[4]  Stephen B. Seidman,et al.  Network structure and minimum degree , 1983 .

[5]  Stefan Wuchty,et al.  Peeling the yeast protein network , 2005, Proteomics.

[6]  Gary D. Bader,et al.  An automated method for finding molecular complexes in large protein interaction networks , 2003, BMC Bioinformatics.

[7]  Dimitrios M. Thilikos,et al.  The Linkage of a Graph , 1996, SIAM J. Comput..

[8]  Evangelos E. Milios,et al.  Characterization of Graphs Using Degree Cores , 2007, WAW.

[9]  R. Alba.  A graph‐theoretic definition of a sociometric clique† , 1973 .

[10]  A. Rbnyi.  ON THE EVOLUTION OF RANDOM GRAPHS , 2001 .

[11]  Deryk Osthus,et al.  Popularity based random graph models leading to a scale-free degree sequence , 2004, Discret. Math..

[12]  Béla Bollobás,et al.  The degree sequence of a scale‐free random graph process , 2001, Random Struct. Algorithms.

[13]  Lucas Rioux-Maldague.  Graph Coloring Algorithms , 2014 .

[14]  Dimitrios M. Thilikos,et al.  D-cores: measuring collaboration of directed graphs based on degeneracy , 2011, Knowledge and Information Systems.

[15]  Alan M. Frieze,et al.  A general model of web graphs , 2003, Random Struct. Algorithms.

[16]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[17]  G. Szekeres,et al.  An inequality for the chromatic number of a graph , 1968 .

[18]  Moses Charikar,et al.  Greedy approximation algorithms for finding dense components in a graph , 2000, APPROX.

[19]  Vladimir Batagelj,et al.  Pajek - Analysis and Visualization of Large Networks , 2004, Graph Drawing Software.

[20]  Meir Fershtman,et al.  Cohesive group detection in a social network by the segregation matrix index , 1997 .

[21]  Yuan An,et al.  Characterizing and Mining Citation Graph of Computer Science Literature , 2001 .

[22]  S. N. Dorogovtsev,et al.  Structure of growing networks with preferential linking. , 2000, Physical review letters.

[23]  Béla Bollobás,et al.  The Diameter of a Scale-Free Random Graph , 2004, Comb..

[24]  P. Erdös.  On the structure of linear graphs , 1946 .

[25]  R. Luce,et al.  Connectivity and generalized cliques in sociometric group structure , 1950, Psychometrika.

[26]  Vasileios Kandylas,et al.  Finding cohesive clusters for analyzing knowledge communities , 2007, Seventh IEEE International Conference on Data Mining (ICDM 2007).

[27]  A. Barabasi,et al.  Scale-free characteristics of random networks: the topology of the world-wide web , 2000 .

[28]  Joel H. Spencer,et al.  Sudden Emergence of a Giantk-Core in a Random Graph , 1996, J. Comb. Theory, Ser. B.

[29]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[30]  Alessandro Vespignani,et al.  Large scale networks fingerprinting and visualization using the k-core decomposition , 2005, NIPS.

[31]  Kenneth A. Frank,et al.  Identifying cohesive subgroups , 1995 .

[32]  Philip S. Yu,et al.  Hierarchical, Parameter-Free Community Discovery , 2008, ECML/PKDD.

[33]  Eugene C. Freuder.  A Sufficient Condition for Backtrack-Free Search , 1982, JACM.

[34]  Ravi Kumar,et al.  Extracting Large-Scale Knowledge Bases from the Web , 1999, VLDB.

[35]  Michael Baur,et al.  Generating Graphs with Predefined k-Core Structure , 2007 .

[36]  Alessandro Vespignani,et al.  K-core Decomposition: a Tool for the Visualization of Large Scale Networks , 2005, ArXiv.

[37]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[38]  D. R. White,et al.  Structural cohesion and embeddedness: A hierarchical concept of social groups , 2003 .

[39]  Sergey N. Dorogovtsev,et al.  K-core Organization of Complex Networks , 2005, Physical review letters.