Related papers: Interaction Graphs: Graphings

Let $L$ be a sequence $(\ell_1,\ell_2,\ldots,\ell_n)$ of $n$ lines in $\mathbb{C}^3$. We define the {\it intersection graph} $G_L=([n],E)$ of $L$, where $[n]:=\{1,\ldots, n\}$, and with $\{i,j\}\in E$ if and only if $i\neq j$ and the…

Data defined over a network have been successfully modelled by means of graph filters. However, although in many scenarios the connectivity of the network is known, e.g., smart grids, social networks, etc., the lack of well-defined…

Graphs can represent relational information among entities and graph structures are widely used in many intelligent tasks such as search, recommendation, and question answering. However, most of the graph-structured data in practice suffers…

Inspired by some new advances on normal factor graphs (NFGs), we introduce NFGs as a simple and intuitive diagrammatic approach towards encoding some concepts from linear algebra. We illustrate with examples the workings of such an approach…

The divisor theory for graphs is compared to the theory of linear series on curves through the correspondence associating a curve to its dual graph. An algebro-geometric interpretation of the combinatorial rank is proposed, and proved in…

Graph-based signal processing techniques have become essential for handling data in non-Euclidean spaces. However, there is a growing awareness that these graph models might need to be expanded into `higher-order' domains to effectively…

Geometric Graph Neural Networks (GNNs) and Transformers have become state-of-the-art for learning from 3D protein structures. However, their reliance on message passing prevents them from capturing the hierarchical interactions that govern…

We consider arrangements of axis-aligned rectangles in the plane. A geometric arrangement specifies the coordinates of all rectangles, while a combinatorial arrangement specifies only the respective intersection type in which each pair of…

Interaction modeling is important for video action analysis. Recently, several works design specific structures to model interactions in videos. However, their structures are manually designed and non-adaptive, which require structures…

This work studies certain aspects of graphs embedded on surfaces. Initially, a colored graph model for a map of a graph on a surface is developed. Then, a concept analogous to (and extending) planar graph is introduced in the same spirit as…

Many current challenges involve understanding the complex dynamical interplay between the constituents of systems. Typically, the number of such constituents is high, but only limited data sources on them are available. Conventional…

Inspired by the "generalized t-designs" defined by Cameron [P. J. Cameron, A generalisation of t-designs, Discrete Math. 309 (2009), 4835--4842], we define a new class of combinatorial designs which simultaneously provide a generalization…

In the recent years, several polynomial algorithms of a dynamical nature have been proposed to address the graph isomorphism problem. In this paper we propose a generalization of an approach exposed in cond-mat/0209112 and find that this…

In this Note, we propose a line bundle approach to odd-dimensional analogues of generalized complex structures. This new approach has three main advantages: (1) it encompasses all existing ones; (2) it elucidates the geometric meaning of…

Graph neural networks (GNNs) are powerful graph-based deep-learning models that have gained significant attention and demonstrated remarkable performance in various domains, including natural language processing, drug discovery, and…

This is a book on higher-categorical diagrams, including pasting diagrams. It aims to provide a thorough and modern reference on the subject, collecting, revisiting and expanding results scattered across the literature, informed by recent…

We extend the concept of the law of a finite graph to graphings, which are, in general, infinite graphs whose vertices are equipped with the structure of a probability space. By doing this, we obtain a vast array of new unimodular measures.…

Graph Interpolation Grammars are a declarative formalism with an operational semantics. Their goal is to emulate salient features of the human parser, and notably incrementality. The parsing process defined by GIGs incrementally builds a…

We develop a new framework for the study of complex continuous time dynamical systems based on viewing them as collections of interacting control modules. This framework is inspired by and builds upon the groupoid formalism of Golubitsky,…

Global variational approximation methods in graphical models allow efficient approximate inference of complex posterior distributions by using a simpler model. The choice of the approximating model determines a tradeoff between the…