@article{seidman1983network, abstract = {Social network researchers have long sought measures of network cohesion, Density has often been used for this purpose, despite its generally admitted deficiencies. An approach to network cohesion is proposed that is based on minimum degree and which produces a sequence of subgraphs of gradually increasing cohesion. The approach also associates with any network measures of local density which promise to be useful both in characterizing network structures and in comparing networks.}, author = {Seidman, Stephen B.}, doi = {10.1016/0378-8733(83)90028-X}, interhash = {bdba8b78574faec3a7315423e29b7556}, intrahash = {402ff073bdbfef97765e307068f59110}, issn = {0378-8733}, journal = {Social Networks}, number = 3, pages = {269 - 287}, title = {Network structure and minimum degree}, url = {http://www.sciencedirect.com/science/article/pii/037887338390028X}, volume = 5, year = 1983 } @misc{batagelj2003algorithm, abstract = {The structure of large networks can be revealed by partitioning them to smaller parts, which are easier to handle. One of such decompositions is based on $k$--cores, proposed in 1983 by Seidman. In the paper an efficient, $O(m)$, $m$ is the number of lines, algorithm for determining the cores decomposition of a given network is presented.}, author = {Batagelj, V. and Zaversnik, M.}, interhash = {63be428635128d4eebd095e2ca44cdf2}, intrahash = {d533733cd010732a5ca81417f4deca0a}, note = {cite arxiv:cs/0310049}, title = {An O(m) Algorithm for Cores Decomposition of Networks}, url = {http://arxiv.org/abs/cs/0310049}, year = 2003 } @incollection{batagelj1999partitioning, abstract = {The structure of large graphs can be revealed by partitioning graphs to smaller parts, which are easier to handle. In the paper we propose the use of core decomposition as an efficient approach for partitioning large graphs. On the selected subgraphs, computationally more intensive, clustering and blockmodeling can be used to analyze their internal structure. The approach is illustrated by an analysis of Snyder & Kick’s world trade graph.}, address = {Berlin / Heidelberg}, affiliation = {FMF, Department of Mathematics, and IMFM Department of Theoretical Computer Science University of Ljubljana Jadranska 19 1000 Ljubljana Slovenia}, author = {Batagelj, Vladimir and Mrvar, Andrej and Zaveršnik, Matjaž}, booktitle = {Graph Drawing}, doi = {10.1007/3-540-46648-7_9}, editor = {Kratochvíyl, Jan}, interhash = {223ade3dd692bb262a6398e1442b4dfd}, intrahash = {2e005638761fc15757dd18113783aa97}, isbn = {978-3-540-66904-3}, keyword = {Computer Science}, pages = {90-97}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, title = {Partitioning Approach to Visualization of Large Graphs}, url = {http://dx.doi.org/10.1007/3-540-46648-7_9}, volume = 1731, year = 1999 } @article{batagelj2011algorithms, abstract = {The structure of a large network (graph) can often be revealed by partitioning it into smaller and possibly more dense sub-networks that are easier to handle. One of such decompositions is based on “ k -cores”, proposed in 1983 by Seidman. Together with connectivity components, cores are one among few concepts that provide efficient decompositions of large graphs and networks. In this paper we propose an efficient algorithm for determining the cores decomposition of a given network with complexity $${\mathcal{O}(m)}$$, where m is the number of lines (edges or arcs). In the second part of the paper the classical concept of k -core is generalized in a way that uses a vertex property function instead of degree of a vertex. For local monotone vertex property functions the corresponding generalized cores can be determined in $${\mathcal{O}(m\cdot\max(\Delta,\log{n}))}$$ time, where n is the number of vertices and Δ is the maximum degree. Finally the proposed algorithms are illustrated by the analysis of a collaboration network in the field of computational geometry.}, address = {Berlin / Heidelberg}, affiliation = {Department of Mathematics, FMF, University of Ljubljana, Jadranska 19, 1000 Ljubljana, Slovenia}, author = {Batagelj, Vladimir and Zaveršnik, Matjaž}, doi = {10.1007/s11634-010-0079-y}, interhash = {a0bd7331f81bb4da72ce115d5943d6e4}, intrahash = {cd0d5266688af6bb98bde7f99e3a54c1}, issn = {1862-5347}, journal = {Advances in Data Analysis and Classification}, keyword = {Mathematics and Statistics}, number = 2, pages = {129-145}, publisher = {Springer}, title = {Fast algorithms for determining (generalized) core groups in social networks}, url = {http://dx.doi.org/10.1007/s11634-010-0079-y}, volume = 5, year = 2011 } @inproceedings{pereiranunes2012entities, abstract = {The richness of the (Semantic) Web lies in its ability to link related resources as well as data across the Web. However, while relations within particular datasets are often well defined, links between disparate datasets and corpora of Web resources are rare. The increasingly widespread use of cross-domain reference datasets, such as Freebase and DBpedia for annotating and enriching datasets as well as document corpora, opens up opportunities to exploit their inherent semantics to uncover semantic relationships between disparate resources. In this paper, we present an approach to uncover relationships between disparate entities by analyzing the graphs of used reference datasets. We adapt a relationship assessment methodology from social network theory to measure the connectivity between entities in reference datasets and exploit these measures to identify correlated Web resources. Finally, we present an evaluation of our approach using the publicly available datasets Bibsonomy and USAToday. }, author = {Pereira Nunes, Bernardo and Kawase, Ricardo and Dietze, Stefan and Taibi, Davide and Casanova, Marco Antonio and Nejdl, Wolfgang}, booktitle = {Proceedings of the Web of Linked Entities Workshop in conjuction with the 11th International Semantic Web Conference}, editor = {Rizzo, Giuseppe and Mendes, Pablo and Charton, Eric and Hellmann, Sebastian and Kalyanpur, Aditya}, institution = {Bernardo Pereira Nunes, Ricardo Kawase, Stefan Dietze, Davide Taibi, Marco Antonio Casanova, Wolfgang Nejdl}, interhash = {8f969b917268449792c130dcbab06e69}, intrahash = {f22943239296ada0dfa11c30c5b4904a}, issb = {1613-0073}, month = nov, pages = {45--57}, series = {CEUR-WS.org}, title = {Can Entities be Friends?}, url = {http://ceur-ws.org/Vol-906/paper6.pdf}, urn = {urn:nbn:de:0074-906-7}, volume = 906, year = 2012 } @inproceedings{zesch2007analysis, abstract = {In this paper, we discuss two graphs in Wikipedia (i) the article graph, and (ii) the category graph. We perform a graph-theoretic analysis of the category graph, and show that it is a scale-free, small world graph like other well-known lexical semantic networks. We substantiate our findings by transferring semantic relatedness algorithms defined on WordNet to the Wikipedia category graph. To assess the usefulness of the category graph as an NLP resource, we analyze its coverage and the performance of the transferred semantic relatedness algorithms. }, address = {Rochester}, author = {Zesch, Torsten and Gurevych, Iryna}, booktitle = {Proceedings of the TextGraphs-2 Workshop (NAACL-HLT)}, interhash = {0401e62edb9bfa85dd498cb40301c0cb}, intrahash = {332ed720a72bf069275f93485432314b}, month = apr, pages = {1--8}, publisher = {Association for Computational Linguistics}, title = {Analysis of the Wikipedia Category Graph for NLP Applications}, url = {http://acl.ldc.upenn.edu/W/W07/W07-02.pdf#page=11}, year = 2007 } @article{liu2012fulltext, author = {Liu, Xiaozhong and Zhang, Jinsong and Guo, Chun}, interhash = {011df26355ad51a88947017fd2791a98}, intrahash = {f9c6133bf4503003822f99860f864698}, journal = {Journal of the American Society for Information Science and Technology}, title = {Full-Text Citation Analysis: A New Method to Enhance Scholarly Network}, url = {http://discern.uits.iu.edu:8790/publication/Full%20text%20citation.pdf}, year = 2012 } @article{liu2012fulltext, author = {Liu, Xiaozhong and Zhang, Jinsong and Guo, Chun}, interhash = {011df26355ad51a88947017fd2791a98}, intrahash = {f9c6133bf4503003822f99860f864698}, journal = {Journal of the American Society for Information Science and Technology}, title = {Full-Text Citation Analysis: A New Method to Enhance Scholarly Network}, url = {http://discern.uits.iu.edu:8790/publication/Full%20text%20citation.pdf}, year = 2012 } @inproceedings{baur2007generating, abstract = {The modeling of realistic networks is of great importance for modern complex systems research. Previous procedures typically model the natural growth of networks by means of iteratively adding nodes, geometric positioning information, a definition of link connectivity based on the preference for nearest neighbors or already highly connected nodes, or combine several of these approaches. Our novel model is based on the well-know concept of k-cores, originally introduced in social network analysis. Recent studies exposed the significant k-core structure of several real world systems, e.g. the AS network of the Internet. We present a simple and efficient method for generating networks which strictly adhere to the characteristics of a given k-core structure, called core fingerprint. We show-case our algorithm in a comparative evaluation with two well-known AS network generators. }, author = {Baur, Michael and Gaertler, Marco and Görke, Robert and Krug, Marcus and Wagner, Dorothea}, booktitle = {Proceedings of the European Conference of Complex Systems}, interhash = {387eebb80bbfaafab5ac201c88ebd263}, intrahash = {e2fef8dce15087afbcc3489f2029d2c6}, month = oct, title = {Generating Graphs with Predefined k-Core Structure}, url = {http://i11www.ira.uka.de/extra/publications/bggkw-ggpcs-07.pdf}, year = 2007 } @misc{ugander2011anatomy, abstract = {We study the structure of the social graph of active Facebook users, the largest social network ever analyzed. We compute numerous features of the graph including the number of users and friendships, the degree distribution, path lengths, clustering, and mixing patterns. Our results center around three main observations. First, we characterize the global structure of the graph, determining that the social network is nearly fully connected, with 99.91% of individuals belonging to a single large connected component, and we confirm the "six degrees of separation" phenomenon on a global scale. Second, by studying the average local clustering coefficient and degeneracy of graph neighborhoods, we show that while the Facebook graph as a whole is clearly sparse, the graph neighborhoods of users contain surprisingly dense structure. Third, we characterize the assortativity patterns present in the graph by studying the basic demographic and network properties of users. We observe clear degree assortativity and characterize the extent to which "your friends have more friends than you". Furthermore, we observe a strong effect of age on friendship preferences as well as a globally modular community structure driven by nationality, but we do not find any strong gender homophily. We compare our results with those from smaller social networks and find mostly, but not entirely, agreement on common structural network characteristics.}, author = {Ugander, Johan and Karrer, Brian and Backstrom, Lars and Marlow, Cameron}, interhash = {968abebf69b5959d2837eefcda3a8a32}, intrahash = {efad3d029704f09829373a443eeefdde}, note = {cite arxiv:1111.4503Comment: 17 pages, 9 figures, 1 table}, title = {The Anatomy of the Facebook Social Graph}, url = {http://arxiv.org/abs/1111.4503}, year = 2011 } @article{landia2013deeper, abstract = {The information contained in social tagging systems is often modelled as a graph of connections between users, items and tags. Recommendation algorithms such as FolkRank, have the potential to leverage complex relationships in the data, corresponding to multiple hops in the graph. We present an in-depth analysis and evaluation of graph models for social tagging data and propose novel adaptations and extensions of FolkRank to improve tag recommendations. We highlight implicit assumptions made by the widely used folksonomy model, and propose an alternative and more accurate graph-representation of the data. Our extensions of FolkRank address the new item problem by incorporating content data into the algorithm, and significantly improve prediction results on unpruned datasets. Our adaptations address issues in the iterative weight spreading calculation that potentially hinder FolkRank's ability to leverage the deep graph as an information source. Moreover, we evaluate the benefit of considering each deeper level of the graph, and present important insights regarding the characteristics of social tagging data in general. Our results suggest that the base assumption made by conventional weight propagation methods, that closeness in the graph always implies a positive relationship, does not hold for the social tagging domain.}, author = {Landia, Nikolas and Doerfel, Stephan and Jäschke, Robert and Anand, Sarabjot Singh and Hotho, Andreas and Griffiths, Nathan}, interhash = {e8095b13630452ce3ecbae582f32f4bc}, intrahash = {e585a92994be476480545eb62d741642}, journal = {cs.IR}, title = {Deeper Into the Folksonomy Graph: FolkRank Adaptations and Extensions for Improved Tag Recommendations}, url = {http://arxiv.org/abs/1310.1498}, volume = {1310.1498}, year = 2013 } @article{landia2013deeper, abstract = {The information contained in social tagging systems is often modelled as a graph of connections between users, items and tags. Recommendation algorithms such as FolkRank, have the potential to leverage complex relationships in the data, corresponding to multiple hops in the graph. We present an in-depth analysis and evaluation of graph models for social tagging data and propose novel adaptations and extensions of FolkRank to improve tag recommendations. We highlight implicit assumptions made by the widely used folksonomy model, and propose an alternative and more accurate graph-representation of the data. Our extensions of FolkRank address the new item problem by incorporating content data into the algorithm, and significantly improve prediction results on unpruned datasets. Our adaptations address issues in the iterative weight spreading calculation that potentially hinder FolkRank's ability to leverage the deep graph as an information source. Moreover, we evaluate the benefit of considering each deeper level of the graph, and present important insights regarding the characteristics of social tagging data in general. Our results suggest that the base assumption made by conventional weight propagation methods, that closeness in the graph always implies a positive relationship, does not hold for the social tagging domain.}, author = {Landia, Nikolas and Doerfel, Stephan and Jäschke, Robert and Anand, Sarabjot Singh and Hotho, Andreas and Griffiths, Nathan}, interhash = {e8095b13630452ce3ecbae582f32f4bc}, intrahash = {e585a92994be476480545eb62d741642}, journal = {cs.IR}, title = {Deeper Into the Folksonomy Graph: FolkRank Adaptations and Extensions for Improved Tag Recommendations}, url = {http://arxiv.org/abs/1310.1498}, volume = {1310.1498}, year = 2013 } @article{landia2013deeper, abstract = {The information contained in social tagging systems is often modelled as a graph of connections between users, items and tags. Recommendation algorithms such as FolkRank, have the potential to leverage complex relationships in the data, corresponding to multiple hops in the graph. We present an in-depth analysis and evaluation of graph models for social tagging data and propose novel adaptations and extensions of FolkRank to improve tag recommendations. We highlight implicit assumptions made by the widely used folksonomy model, and propose an alternative and more accurate graph-representation of the data. Our extensions of FolkRank address the new item problem by incorporating content data into the algorithm, and significantly improve prediction results on unpruned datasets. Our adaptations address issues in the iterative weight spreading calculation that potentially hinder FolkRank's ability to leverage the deep graph as an information source. Moreover, we evaluate the benefit of considering each deeper level of the graph, and present important insights regarding the characteristics of social tagging data in general. Our results suggest that the base assumption made by conventional weight propagation methods, that closeness in the graph always implies a positive relationship, does not hold for the social tagging domain.}, author = {Landia, Nikolas and Doerfel, Stephan and Jäschke, Robert and Anand, Sarabjot Singh and Hotho, Andreas and Griffiths, Nathan}, interhash = {e8095b13630452ce3ecbae582f32f4bc}, intrahash = {e585a92994be476480545eb62d741642}, journal = {cs.IR}, title = {Deeper Into the Folksonomy Graph: FolkRank Adaptations and Extensions for Improved Tag Recommendations}, url = {http://arxiv.org/abs/1310.1498}, volume = {1310.1498}, year = 2013 } @inproceedings{doerfel2013analysis, abstract = {Since the rise of collaborative tagging systems on the web, the tag recommendation task -- suggesting suitable tags to users of such systems while they add resources to their collection -- has been tackled. However, the (offline) evaluation of tag recommendation algorithms usually suffers from difficulties like the sparseness of the data or the cold start problem for new resources or users. Previous studies therefore often used so-called post-cores (specific subsets of the original datasets) for their experiments. In this paper, we conduct a large-scale experiment in which we analyze different tag recommendation algorithms on different cores of three real-world datasets. We show, that a recommender's performance depends on the particular core and explore correlations between performances on different cores.}, acmid = {2507222}, address = {New York, NY, USA}, author = {Doerfel, Stephan and Jäschke, Robert}, booktitle = {Proceedings of the 7th ACM conference on Recommender systems}, doi = {10.1145/2507157.2507222}, interhash = {3eaf2beb1cdad39b7c5735a82c3338dd}, intrahash = {aa4b3d79a362d7415aaa77625b590dfa}, isbn = {978-1-4503-2409-0}, location = {Hong Kong, China}, numpages = {4}, pages = {343--346}, publisher = {ACM}, series = {RecSys '13}, title = {An analysis of tag-recommender evaluation procedures}, url = {https://www.kde.cs.uni-kassel.de/pub/pdf/doerfel2013analysis.pdf}, year = 2013 } @book{diestel2006graphentheorie, author = {Diestel, Reinhard}, edition = {3 (electronic edition)}, interhash = {f2579f4c24fdf2233f0a0565b34e8ac1}, intrahash = {bf75f61d316d1d149e2b7e0d72cd937c}, pages = {I-XVI, 1-344}, publisher = {Springer-Verlag Heidelberg, New York}, title = {Graph Theory}, url = {http://www.math.ubc.ca/~solymosi/2007/443/GraphTheoryIII.pdf}, year = 2005 } @book{janson2000theory, address = {New York; Chichester}, author = {Janson, Svante and Luczak, Tomasz and Rucinski, Andrzej}, interhash = {929294638db37c413b283ac468bbdade}, intrahash = {7bb074240f72009f515123f15afecefd}, isbn = {0471175412 9780471175414}, publisher = {John Wiley & Sons}, refid = {43340250}, title = {Theory of random graphs}, url = {http://www.amazon.com/Random-Graphs-Svante-Janson/dp/0471175412}, year = 2000 } @article{noKey, abstract = {Bildeten die Keimzellen des Internet noch kleine und einfach strukturierte Netze, so vergrößerten sich sowohl seine physikalischen als auch seine logischen Topologien später rasant. Wuchs einerseits das Netz aus Rechnern als Knoten und Verbindungsleitungen als Kanten immer weiter, so bedienten sich andererseits gleichzeitig immer mehr Anwendungen dieser Infrastruktur, um darüber ihrerseits immer größere und komplexere virtuelle Netze zu weben, z. B. das WWW oder soziale Online-Netze. Auf jeder Ebene dieser Hierarchie lassen sich die jeweiligen Netztopologien mithilfe von Graphen beschreiben und so mathematisch untersuchen. So ergeben sich interessante Einblicke in die Struktureigenschaften unterschiedlicher Graphentypen, die großen Einfluss auf die Leistungsfähigkeit des Internet haben. Hierzu werden charakteristische Eigenschaften und entsprechende Kenngrößen verschiedener Graphentypen betrachtet wie der Knotengrad, die Durchschnittsdistanz, die Variation der Kantendichte in unterschiedlichen Netzteilen und die topologische Robustheit als Widerstandsfähigkeit gegenüber Ausfällen und Angriffen. Es wird dabei Bezug genommen auf analytische, simulative und zahlreiche empirische Untersuchungen des Internets und hingewiesen auf Simulationsprogramme sowie Abbildungen von Internetgraphen im Internet. }, author = {Heidtmann, Klaus}, doi = {10.1007/s00287-012-0654-z}, interhash = {d1ab5ecb2270150ba3d46e156d3a1139}, intrahash = {783481b980117c756d4560c1640ae4a0}, issn = {0170-6012}, journal = {Informatik-Spektrum}, language = {German}, number = 5, pages = {440-448}, publisher = {Springer Berlin Heidelberg}, title = {Internet-Graphen}, url = {http://dx.doi.org/10.1007/s00287-012-0654-z}, volume = 36, year = 2013 } @inproceedings{DBLP:conf/dsaa/KrompassNT14, author = {Krompass, Denis and Nickel, Maximilian and Tresp, Volker}, bibsource = {dblp computer science bibliography, http://dblp.org}, booktitle = {International Conference on Data Science and Advanced Analytics, {DSAA} 2014, Shanghai, China, October 30 - November 1, 2014}, crossref = {DBLP:conf/dsaa/2014}, doi = {10.1109/DSAA.2014.7058046}, interhash = {0ca986606c22ca0b3780c9b9c25f31c7}, intrahash = {c952ed96ece470e4fa5336eedf670d5b}, isbn = {978-1-4799-6991-3}, pages = {18--24}, publisher = {{IEEE}}, title = {Large-scale factorization of type-constrained multi-relational data}, url = {http://dx.doi.org/10.1109/DSAA.2014.7058046}, year = 2014 } @inproceedings{pereiranunes2012entities, abstract = {The richness of the (Semantic) Web lies in its ability to link related resources as well as data across the Web. However, while relations within particular datasets are often well defined, links between disparate datasets and corpora of Web resources are rare. The increasingly widespread use of cross-domain reference datasets, such as Freebase and DBpedia for annotating and enriching datasets as well as document corpora, opens up opportunities to exploit their inherent semantics to uncover semantic relationships between disparate resources. In this paper, we present an approach to uncover relationships between disparate entities by analyzing the graphs of used reference datasets. We adapt a relationship assessment methodology from social network theory to measure the connectivity between entities in reference datasets and exploit these measures to identify correlated Web resources. Finally, we present an evaluation of our approach using the publicly available datasets Bibsonomy and USAToday. }, author = {Pereira Nunes, Bernardo and Kawase, Ricardo and Dietze, Stefan and Taibi, Davide and Casanova, Marco Antonio and Nejdl, Wolfgang}, booktitle = {Proceedings of the Web of Linked Entities Workshop in conjuction with the 11th International Semantic Web Conference}, editor = {Rizzo, Giuseppe and Mendes, Pablo and Charton, Eric and Hellmann, Sebastian and Kalyanpur, Aditya}, institution = {Bernardo Pereira Nunes, Ricardo Kawase, Stefan Dietze, Davide Taibi, Marco Antonio Casanova, Wolfgang Nejdl}, interhash = {8f969b917268449792c130dcbab06e69}, intrahash = {f22943239296ada0dfa11c30c5b4904a}, issb = {1613-0073}, month = nov, pages = {45--57}, series = {CEUR-WS.org}, title = {Can Entities be Friends?}, url = {http://ceur-ws.org/Vol-906/paper6.pdf}, urn = {urn:nbn:de:0074-906-7}, volume = 906, year = 2012 } @article{thomas2023graph, abstract = {Graphs are ubiquitous in nature and can therefore serve as models for many practical but also theoretical problems. For this purpose, they can be defined as many different types which suitably reflect the individual contexts of the represented problem. To address cutting-edge problems based on graph data, the research field of Graph Neural Networks (GNNs) has emerged. Despite the field’s youth and the speed at which new models are developed, many recent surveys have been published to keep track of them. Nevertheless, it has not yet been gathered which GNN can process what kind of graph types. In this survey, we give a detailed overview of already existing GNNs and, unlike previous surveys, categorize them according to their ability to handle different graph types and properties. We consider GNNs operating on static and dynamic graphs of different structural constitutions, with or without node or edge attributes. Moreover, we distinguish between GNN models for discrete-time or continuous-time dynamic graphs and group the models according to their architecture. We find that there are still graph types that are not or only rarely covered by existing GNN models. We point out where models are missing and give potential reasons for their absence.}, author = {Thomas, Josephine and Moallemy-Oureh, Alice and Beddar-Wiesing, Silvia and Holzhüter, Clara}, interhash = {229b2eb23d7fdfdf16d3c6d813e4c106}, intrahash = {853c98d29b7c266e48e1cabd45dc5854}, journal = {Transactions on Machine Learning Research}, title = {Graph Neural Networks Designed for Different Graph Types: A Survey}, url = {https://openreview.net/pdf?id=h4BYtZ79uy}, year = 2023 }