Abstract
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.
Similar content being viewed by others
References
Alba RD (1973) A graph-theoretic definition of a sociometric clique. J Math Sociol 3:113–126
Alvarez-Hamelin JI, Dall’Asta L, Barrat A, Vespignani A (2005) \(k\)-core decomposition: a tool for the visualization of large scale networks. CoRR, cs.NI/0504107
Alvarez-Hamelin JI, Dall’Asta L, Barrat A, Vespignani A (2006) Large scale networks fingerprinting and visualization using the \(k\)-core decomposition. In: Weiss Y, Schölkopf B, Platt J (eds) Advances in neural information processing systems, vol 18. MIT Press, Cambridge, pp 41–50
An Y, Janssen J, Milios EE (2004) Characterizing and mining the citation graph of the computer science literature. Knowl Inf Syst 6:664–678. doi:10.1007/s10115-003-0128-3
Bader GD, Hogue CWV (2003) An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinformat 4:1–1
Barabási A-L, Albert R (1999) Emergence of scaling in random networks. Science 286:509–512
Barabási A-L, Albert R, Jeong H (2000) Scale-free characteristics of random networks: the topology of the world-wide web. Phys A Stat Mech Appl 281:69–77
Batagelj V, Mrvar A (2002) Pajek—analysis and visualization of large networks. In: Mutzel P, Jünger M, Leipert S (eds) Graph Drawing, volume 2265 of Lecture Notes in Computer Science. Springer, Berlin, pp 8–11
Batagelj V, Zaversnik M (2002) Generalized cores. CoRR, cs.DS/0202039
Baur M, Gaertler M, Görke R, Krug M, Wagner D (2007) Generating graphs with predefined \(k\)-core structure. In: Proceedings of the European conference of complex systems (ECCS’07), Oct. 2007
Bollobas B, Borgs C, Chayes J, Riordan O (2003) Directed scale-free graph. In: Proceedings of 14th ACM-SIAM symposium on discrete algorithms, pp 132–139
Bollobás B, Riordan O (2004) The diameter of a scale-free random graph. Combinatorica 24:5–34
Bollobs B, Riordan O, Spencer J, Tusnády G (2001) The degree sequence of a scale-free random graph process. Random Struct Algorithms 18(3):279–290
Buckley PG, Osthus D (2001) Popularity based random graph models leading to a scale-free degree sequence. Discrete Math 282:53–68
Carmi S, Havlin S, Kirkpatrick S, Shavitt Y, Shir E (2006) MEDUSA—new model of internet topology using k-shell decomposition, arXiv:cond-mat/0601240
Charikar M, (2000) Greedy approximation algorithms for finding dense components in a graph. In: Approximation algorithms for combinatorial optimization (Saarbrücken), (2000) volume 1913 of Lecture Notes in Computer Science. Springer, Berlin, pp 84–95
Cooper C, Frieze A (2003) A general model of web graphs. Random Struct Algorithms 22:311–335
Diestel R (2005) Graph theory, volume 173 of Graduate texts in mathematics. Springer, Berlin
Dorogovtsev SN, Goltsev AV, Mendes JFF (2006) \(k\)-core organization of complex networks. Phys Rev Lett 96:040601
Dorogovtsev SN, Mendes JFF, Samukhin AN (2000) Structure of growing networks with preferential linking. Phys Rev Lett 85(21):4633–4636
Drinea E, Enachescu M, Mitzenmacher M (2001) Variations on random graph models for the web. Computer Science Group Harvard University, Cambridge
Erdős P (1963) On the structure of linear graphs. Israel J Math 1:156–160
Erdős P, Rényi A (1960) On the evolution of random graphs. Magyar Tud Akad Mat Kutató Int Közl 5:17–61
Fershtman M (1997) Cohesive group detection in a social network by the segregation matrix index. Social Netw 19:193–207
Fortunato S (2010) Community detection in graphs. Phys Rep 486(3–5):75–174
Frank KA (1995) Identifying cohesive subgroups. Social Netw 17:27–56
Freuder EC (1982) A sufficient condition for backtrack-free search. J Assoc Comput Mach 29(1):24–32
Giatsidis C, Thilikos DM, Vazirgiannis M (2011) D-cores: measuring collaboration of directed graphs based on degeneracy. In: ICDM, pp 201–210
Giatsidis C, Thilikos DM, Vazirgiannis M (2011) Evaluating cooperation in communities with the \(k\)-core structure. In: ASONAM. IEEE Computer Society, pp 87–93
Healy J, Janssen J, Milios E, Aiello W (2008) Characterization of graphs using degree cores. In: Algorithms and models for the Web-Graph: fourth international workshop, WAW 2006, volume LNCS-4936 of Lecture notes in computer science. Springer, Banff, Nov. 30–Dec. 1, 2008
Kandylas V, Upham S, Ungar L (2008) Finding cohesive clusters for analyzing knowledge communities. Knowl Inf Syst 17:335–354. doi:10.1007/s10115-008-0135-5
Kirousis LM, Thilikos DM (1996) The linkage of a graph. SIAM J Comput 25(3):626–647
Kumar R, Raghavan P, Rajagopalan S, Sivakumar D, Tomkins A, Upfal E (2000) Stochastic models for the web graph. In: Proceedings of the 41st annual symposium on foundations of computer science. IEEE Computer Society . Washington, DC, USA, p 57
Kumar R, Raghavan P, Rajagopalan S, Tomkins A (1999) Extracting large-scale knowledge bases from the web. In: VLDB ’99: proceedings of the 25th international conference on very large data bases. Morgan Kaufmann, San Francisco, pp 639–650
Luce D (1950) Connectivity and generalized cliques in sociometric group structure. Psychometrika 15:169–190
Matula DW (1968) A min-max theorem for graphs with application to graph coloring. SIAM Rev 10:481–482
Matula DW, Marble G, Isaacson JD (1972) Graph coloring algorithms. In: Graph theory and computing. Academic Press, New York, pp 109–122
Moody J, White DR (2007) Structural cohesion and embeddedness: a hierarchical concept of social groups. Am Sociol Rev 68(1):103–127
Papadimitriou S, Sun J, Faloutsos C, Yu PS (2008) Hierarchical, parameter-free community discovery. In: ECML/PKDD (2), pp 170–187
Pittel B, Spencer J, Wormald N (1996) Sudden emergence of a giant \(k\)-core in a random graph. J Combinatorial Theory Ser B 67(1):111–151
Seidman SB (1983) Network structure and minimum degree. Social Netw 5(3):269–287
Szekeres G, Wilf HS (1968) An inequality for the chromatic number of a graph. J Combinatorial Theory 4:1–3
Wasserman S, Faust K (1994) Social networks analysis: methods and applications. Cambridge University Press, Cambridge
Wuchty S, Almaas E (2005) Peeling the yeast protein network. Proteomics 5(2):444–449
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Giatsidis, C., Thilikos, D.M. & Vazirgiannis, M. D-cores: measuring collaboration of directed graphs based on degeneracy. Knowl Inf Syst 35, 311–343 (2013). https://doi.org/10.1007/s10115-012-0539-0
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10115-012-0539-0