Related papers: Introducing Loopedia
This contribution proposes a new approach towards developing a class of probabilistic methods for classifying attributed graphs. The key concept is random attributed graph, which is defined as an attributed graph whose nodes and edges are…
The aim of this note is threefold. The first is to obtain a simple characterization of relative constructible sheaves when the parameter space is projective. The second is to study the relative Fourier-Mukai for relative constructible…
Graph Neural Networks (GNNs) have achieved remarkable success across diverse applications. However, due to the biases in the graph structures, graph neural networks face significant challenges in fairness. Although the original user graph…
We introduce a type of graph integrals which are holomorphic analogs of configuration space integrals. We prove their (ultraviolet) finiteness by considering a compactification of the moduli space of graphs with metrics, and study their…
In this paper, we develop a diamond graph theory and apply the theory to the (co)homology of the Lie algebra generated by positive systems of the classical semi-simple Lie algebras over the field of complex numbers. As an application, we…
Dynamic graphs serve as a generic abstraction and description of the evolutionary behaviors of various complex systems (e.g., social networks and communication networks). Temporal link prediction (TLP) is a classic yet challenging inference…
We present an interactive visualization system for exploring named entities and their relationships across document collections. The system is designed around a graph-based representation that integrates three types of nodes: documents,…
Developing new ideas and algorithms in the fields of graph processing and relational learning requires public datasets. While Wikidata is the largest open source knowledge graph, involving more than fifty million entities, it is larger than…
As science advances, the academic community has published millions of research papers. Researchers devote time and effort to search relevant manuscripts when writing a paper or simply to keep up with current research. In this paper, we…
We present a novel method that can learn a graph representation from multivariate data. In our representation, each node represents a cluster of data points and each edge represents the subset-superset relationship between clusters, which…
Measuring similarity between complex objects is a fundamental task in many scientific fields. When objects are represented as graphs, graph similarity/distance measures offer a powerful framework for quantifying structural resemblance.…
We continue our investigation into the insertion-elimination Lie algebra of Feynman graphs in the ladder case, emphasizing the structure of this Lie algebra relevant for future applications in the study of Dyson-Schwinger equations. We work…
Introduced the quantitative measure of the structural complexity of the graph (complex network, etc.) based on a procedure similar to the renormalization process, considering the difference between actual and averaged graph structures on…
The Linked Open Data (LOD) cloud diagram is a picture that helps us grasp the contents and the links of globally available data sets. Such diagram has been a powerful dissemination method for the Linked Data movement, allowing people to…
The Libra Toolkit is a collection of algorithms for learning and inference with discrete probabilistic models, including Bayesian networks, Markov networks, dependency networks, and sum-product networks. Compared to other toolkits, Libra…
Visibility algorithms transform time series into graphs and encode dynamical information in their topology, paving the way for graph-theoretical time series analysis as well as building a bridge between nonlinear dynamics and network…
The problem of accurately measuring the similarity between graphs is at the core of many applications in a variety of disciplines. Graph kernels have recently emerged as a promising approach to this problem. There are now many kernels, each…
This article is dedicated to domino tilings of certain types of graph grids. For each of these grids, the domino tilings are represented using linear-recurrent sequences. New dependencies are proved that are not included in Neil Sloane's…
Recent advances in methods and techniques enable us to develop an interactive overlay to the global map of science based on aggregated citation relations among the 9,162 journals contained in the Science Citation Index and Social Science…
A new Python API, integrated within the NLTK suite, offers access to the FrameNet 1.7 lexical database. The lexicon (structured in terms of frames) as well as annotated sentences can be processed programatically, or browsed with…