Related papers: A Few Graph-Based Relational Numerical Abstract Do…
Binary relations are one of the standard ways to encode, characterise and reason about graphs. Relation algebras provide equational axioms for a large fragment of the calculus of binary relations. Although relations are standard tools in…
Abstraction is a commonly used process to represent some low-level system by a more coarse specification with the goal to omit unnecessary details while preserving important aspects. While recent work on abstraction in the situation…
In this paper, we introduce new combinatorial invariants of any finite simple graph, which arise in toric topology. We compute the $i$-th (rational) Betti number and Euler characteristic of the real toric variety associated to a graph…
This paper generalize [7](math.GT/0601291): We construct new links invariants from g, a type I basic classical Lie superalgebra. The construction uses the existence of an unexpected replacement of the vanishing quantum dimension of typical…
We introduce topological invariants of semi-decompositions (e.g. filtrations, semi-group actions, multi-valued dynamical systems, combinatorial dynamical systems) on a topological space to analyze semi-decompositions from a dynamical…
Let $R$ be a finite product of integral domains and $D$ be a union of prime ideals (it is possible that $R$ is just an integral domain). Let $n \geq 1$ be a positive integer. This paper introduces the $n$-total graph of a $(R, D)$. The…
Graph Neural Networks (GNN) have recently gained popularity in the forecasting domain due to their ability to model complex spatial and temporal patterns in tasks such as traffic forecasting and region-based demand forecasting. Most of…
In this paper, we construct a digraph structure on $p$-adic dynamical systems defined by rational functions. We study the conditions under which the functions are measure-preserving, invertible and isometric, ergodic, and minimal on…
In this paper, we introduce the notion of the containment graph of a family of sets and containment classes of graphs and posets. Let $Z$ be a family of nonempty sets. We call a (simple, finite) graph G = (V, E) a $Z$-containment graph…
A multi-relational graph maintains two or more relations over a vertex set. This article defines an algebra for traversing such graphs that is based on an $n$-ary relational algebra, a concatenative single-relational path algebra, and a…
Intrinsic interpretability of graph neural networks (GNNs) is to find a small subset of the input graph's features -- rationale -- which guides the model prediction. Unfortunately, the leading rationalization models often rely on data…
We present a novel abstractive summarization framework that draws on the recent development of a treebank for the Abstract Meaning Representation (AMR). In this framework, the source text is parsed to a set of AMR graphs, the graphs are…
Encoder-decoder architectures are prominent building blocks of state-of-the-art solutions for tasks across multiple fields where deep learning (DL) or foundation models play a key role. Although there is a growing community working on the…
Arboreal networks are a generalization of rooted trees, defined by keeping the tree-like structure, but dropping the requirement for a single root. Just as the class of cographs is precisely the class of undirected graphs that can be…
The configuration model was originally defined for undirected networks and has recently been extended to directed networks. Many empirical networks are however neither undirected nor completely directed, but instead usually partially…
We study $C_{0}$-operators relative to a multiply connected domain using a substitute of the characteristic function. This method allows us to prove certain relations between the Jordan model of an operator and that of its restriction to an…
Representing and exploiting multivariate signals requires capturing relations between variables, which we can represent by graphs. Graph dictionaries allow to describe complex relational information as a sparse sum of simpler structures,…
In this paper I consider all possible properties from commutative algebra for polynomial composites and monoid domains. The aim is full characterization of these structures. I start with the examination of group, ring, modules properties,…
We present a form of algebraic reasoning for computational objects which are expressed as graphs. Edges describe the flow of data between primitive operations which are represented by vertices. These graphs have an interface made of…
Any function can be constructed using a hierarchy of simpler functions through compositions. Such a hierarchy can be characterized by a binary rooted tree. Each node of this tree is associated with a function which takes as inputs two…