Related papers: Graph towers, laminations and their invariant meas…
We introduce a class of continuous maps f of a compact metric space I admitting inducing schemes and describe the tower constructions associated with them. We then establish a thermodynamical formalism, i.e., describe a class of real-valued…
Group algebras of permutations have proved highly useful in solving a number of problems in large N gauge theories. I review the use of permutations in classifying gauge invariants in one-matrix and multi-matrix models and computing their…
We propose a new family of combinatorial inference problems for graphical models. Unlike classical statistical inference where the main interest is point estimation or parameter testing, combinatorial inference aims at testing the global…
We introduce a persistence-type invariant for finite weighted graphs based on combinatorial multivector dynamics. For each threshold parameter, a relation matrix determines a graph multivector field, whose induced directed dynamics admits a…
Lattice gauge theories of permutation groups with a simple topological action (henceforth permutation-TFTs) have recently found several applications in the combinatorics of quantum field theories (QFTs). They have been used to solve…
Let $G$ be a group. The permutability graph of subgroups of $G$, denoted by $\Gamma(G)$, is a graph having all the proper subgroups of $G$ as its vertices, and two subgroups are adjacent in $\Gamma(G)$ if and only if they permute. In this…
Let $G$ be a graph and $A$ be its adjacency matrix. A graph $G$ is invertible if its adjacency matrix $A$ is invertible and the inverse of $G$ is a weighted graph with adjacency matrix $A^{-1}$. A signed graph $(G,\sigma)$ is a weighted…
Various classes of Graph Neural Networks (GNN) have been proposed and shown to be successful in a wide range of applications with graph structured data. In this paper, we propose a theoretical framework able to compare the expressive power…
Graph Transformers (GTs) have demonstrated a strong capability in modeling graph structures by addressing the intrinsic limitations of graph neural networks (GNNs), such as over-smoothing and over-squashing. Recent studies have proposed…
We describe recent achievements in the theory of weight systems, which are functions on chord diagrams satisfying so-called $4$-term relations. Our main attention is devoted to constructions of weight systems. The two main sources of these…
It is well known that in a generally covariant gravitational theory the choice of spacetime scalars as coordinates yields phase-space observables (or "invariants"). However their relation to the symmetry group of diffeomorphism…
We state and prove a simple Theorem that allows one to generate invariant quantities in Metric-Affine Geometry, under a given transformation of the affine connection. We start by a general functional of the metric and the connection and…
The goal of graph summarization is to represent large graphs in a structured and compact way. A graph summary based on equivalence classes preserves pre-defined features of a graph's vertex within a $k$-hop neighborhood such as the vertex…
This paper explores the observability and estimation capability of dynamical systems using predominantly relative measurements of the system's state-space variables, with minimal to no reliance on absolute measurements of these variables.…
We introduce Graph Memory (GM), a structured non-parametric framework that represents an embedding space through a compact graph of reliability-annotated prototype regions. GM encodes local geometry and regional ambiguity through prototype…
For a graph $G$, the $\gamma$-graph of $G$, $G(\gamma)$, is the graph whose vertices correspond to the minimum dominating sets of $G$, and where two vertices of $G(\gamma)$ are adjacent if and only if their corresponding dominating sets in…
A reliable perception has to be robust against challenging environmental conditions. Therefore, recent efforts focused on the use of radar sensors in addition to camera and lidar sensors for perception applications. However, the sparsity of…
Using the formalism of noncommutative geometric gauge theory based on the superconnection concept, we construct a new type of vector gauge theory possessing a shift-like symmetry and the usual gauge symmetry. The new shift-like symmetry is…
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper we study convex graph invariants, which are graph invariants…
If $f : \tilde{\Gamma} \rightarrow \Gamma$ is a covering map between connected graphs, and $H$ is the subgroup of $\pi_1(\Gamma,v)$ used to construct the cover, then it is well known that the group of deck transformations of the cover is…