Related papers: Unstable Graphs: A Fresh Outlook via TF-Automorphi…
Graph neural networks (GNNs), consisting of a cascade of layers applying a graph convolution followed by a pointwise nonlinearity, have become a powerful architecture to process signals supported on graphs. Graph convolutions (and thus,…
In 1966, Cummins introduced the "tree graph": the tree graph $\mathbf{T}(G)$ of a graph $G$ (possibly infinite) has all its spanning trees as vertices, and distinct such trees correspond to adjacent vertices if they differ in just one edge,…
The evaluation of graphs on 2-spheres is a central ingredient of the Turaev-Viro construction of three-dimensional topological field theories. In this article, we introduce a class of graphs, called extruded graphs, that is relevant for the…
An automorphism of a graph describes its structural symmetry and the concept of fixing number of a graph is used for breaking its symmetries (except the trivial one). In this paper, we evaluate automorphisms of the co-normal product graph…
Graph Neural Networks (GNNs) are highly vulnerable to adversarial perturbations in both topology and features, making the learning of robust representations a critical challenge. In this work, we bridge GNNs with control theory to introduce…
In this paper we describe the tangent vectors of the stable and unstable manifold of a class of Anosov diffeomorphisms on the torus $\mathbb{T}^2$ using the method of formal series and derivative trees. We start with linear automorphism…
In this article, we study finite dynamical systems defined over graphs, where the functions are applied asynchronously. Our goal is to quantify and understand stability of the dynamics with respect to the update sequence, and to relate this…
We will study homological stability of the diffeomorphism groups of the manifolds $W_{g,1}:=D^{2n} \# (S^n \times S^n)^{\#g }$ using $E_k$-algebras. This will lead to new improvements in the stability results, especially when working with…
The generalized Oberwolfach problem asks for a decomposition of a graph $G$ into specified 2-regular spanning subgraphs $F_1,\ldots, F_k$, called factors. The classic Oberwolfach problem corresponds to the case when all of the factors are…
Graph-based tests are a class of non-parametric two-sample tests useful for analyzing high-dimensional data. The test statistics are constructed from similarity graphs (such as K-minimum spanning tree), and consequently, their performance…
A centrality measure of the cut-edges of an undirected graph, given in [Altafini et al.~SIMAX 2023] and based on Kemeny's constant, is revisited. A numerically more stable expression is given to compute this measure, and an explicit…
We investigate various forms of (model-theoretic) stability for hypergraphs and their corresponding strengthenings of the hypergraph regularity lemma with respect to partitions of vertices. On the one hand, we provide a complete…
We study the two-phase, horizontally periodic, quasistationary Stokes flow in two dimensions driven by surface tension and gravity effects in the general context of fluids with (possibly) different viscosities and densities. The sharp…
Orienting the edges of an undirected graph such that the resulting digraph satisfies some given constraints is a classical problem in graph theory, with multiple algorithmic applications. In particular, an $st$-orientation orients each edge…
We study the existence and topological stability of Fermi points in a graphene layer and stacks with many layers. We show that the discrete symmetries (spacetime inversion) stabilize the Fermi points in monolayer, bilayer and multilayer…
This book is an extension of my doctoral dissertation, focusing on techniques for analyzing stability (dissipativity) and achieving stabilization of linear systems that are characterized by non-trivial distributed delays. It specifically…
In this paper, we report several new geometric and Lyapunov characterizations of incrementally stable systems on Finsler and Riemannian manifolds. A new and intrinsic proof of an important theorem in contraction analysis is given via the…
We consider a model of stable edge sets (``matchings'') in a bipartite graph $G=(V,E)$ in which the preferences for vertices of one side (``firms'') are given via choice functions subject to standard axioms of consistency, substitutability…
Given a graph $F$, a hypergraph is called a Berge-$F$ if it can be obtained by expanding each edge of $F$ into a hyperedge containing it. Let $M_{k}$ denote the matching of size $k$. Kang, Ni, and Shan [12] determined the Tur\'an number of…
The Cartesian product of two cycles (of length m and length n) has a natural embedding on the torus, such that each face of the embedding is a 4-cycle. The toroidal grid Qd(m,n,r) is a generalization of this in which there is a shift by r…