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 sub graph characterized by dense connections or interactions among its nodes. A large variety of measures have been proposed to evaluate the quality 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 real-world graphs such as Wikipedia and DBLP and report interesting results at the graph as well at node level.

[1]  M. Porrati,et al.  D-cores: measuring collaboration of directed graphs based on degeneracy , 2013 .

[2]  Vladimir Batagelj,et al.  Generalized Cores , 2002, ArXiv.

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

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

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

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

[7]  B. Bollobás.  The evolution of random graphs , 1984 .

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

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

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

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

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

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

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

[15]  Béla Bollobás,et al.  Directed scale-free graphs , 2003, SODA '03.

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

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

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

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

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

[21]  Yuval Shavitt,et al.  A model of Internet topology using k-shell decomposition , 2007, Proceedings of the National Academy of Sciences.

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

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

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

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

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

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

[28]  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.

[29]  Reinhard Diestel,et al.  Graph Theory , 1997 .

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

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

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

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

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

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

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

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

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

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

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

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

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

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