Related papers: Toward the Universal Rigidity of General Framework…

In many important graph data processing applications the acquired information includes both node features and observations of the graph topology. Graph neural networks (GNNs) are designed to exploit both sources of evidence but they do not…

A natural problem in combinatorial rigidity theory concerns the determination of the rigidity or flexibility of bar-joint frameworks in $\mathbb{R}^d$ that admit some non-trivial symmetry. When $d=2$ there is a large literature on this…

In the problem of structured prediction with graph representation learning (GRL for short), the hypothesis returned by the algorithm maps the set of features in the \emph{receptive field} of the targeted vertex to its label. To understand…

In this paper we prove a recursive characterisation of generic rigidity for frameworks periodic with respect to a partially variable lattice. We follow the approach of modelling periodic frameworks as frameworks on a torus and use the…

The theory of dependency graphs is a powerful toolbox to prove asymptotic normality of sums of random variables. In this article, we introduce a more general notion of weighted dependency graphs and give normality criteria in this context.…

In this paper we study the property of generic global rigidity for frameworks of graphs embedded in d-dimensional complex space and in a d-dimensional pseudo-Euclidean space ($R^d$ with a metric of indefinite signature). We show that a…

In 2015, Chen, Liang and Wang provided several sufficient conditions for the total positivity of Riordan arrays and asked for combinatorial proofs of these results. In this paper, we present such proofs by constructing suitable planar…

Structural balance theory predicts that triads in networks gravitate towards stable configurations. The theory has been verified for undirected graphs. Since real-world networks are often directed, we introduce a novel method for…

Let ${\rm dim}(G)$ and $D(G)$ respectively denote the metric dimension and the distinguishing number of a graph $G$. It is proved that $D(G) \le {\rm dim}(G)+1$ holds for every connected graph $G$. Among trees, exactly paths and stars…

If $G$ is a graph with vertex set $V$, let Conf$_n^{\text{sink}}(G,V)$ be the space of $n$-tuples of points on $G$, which are only allowed to overlap on elements of $V$. We think of Conf$_n^{\text{sink}}(G,V)$ as a configuration space of…

The special linear group G=SL_n(Z[x1,...,xk]) (n at least 3 and k finite) is called the universal lattice. Let n be at least 4, p be any real number in (1,\infty). The main result is the following: any finite index subgroup of G has the…

A graph $G$ is embeddable in $\mathbb{R}^d$ if vertices of $G$ can be assigned with points of $\mathbb{R}^d$ in such a way that all pairs of adjacent vertices are at the distance 1. We show that verifying embeddability of a given graph in…

Universal security over a network with linear network coding has been intensively studied. However, previous linear codes used for this purpose were linear over a larger field than that used on the network. In this work, we introduce new…

Graph neural networks are becoming increasingly popular in the field of machine learning due to their unique ability to process data structured in graphs. They have also been applied in safety-critical environments where perturbations…

The set of matrices of given positive semidefinite rank is semialgebraic. In this paper we study the geometry of this set, and in small cases we describe its boundary. For general values of positive semidefinite rank we provide a conjecture…

Graph Neural Networks (GNNs) have demonstrated remarkable effectiveness on graph-based tasks. However, their predictive confidence is often miscalibrated, typically exhibiting under-confidence, which harms the reliability of their…

The generalized $k$-connectivity $\kappa_{k}(G)$ of a graph $G$ is a parameter that can measure the reliability of a network $G$ to connect any $k$ vertices in $G$, which is proved to be NP-complete for a general graph $G$. Let $S\subseteq…

Let $G$ be a linear semisimple Lie group without compact factors. We show that uniform approximate lattices $\Lambda$ arising as regular model sets in $G$ determine the ambient group $G$ in a strong sense. Specifically, for every…

Using a probabilistic method, we prove that $d(d+1)$-connected graphs are rigid in $\mathbb{R}^d$, a conjecture of Lov\'asz and Yemini. Then, using recent results on weakly globally linked pairs, we modify our argument to prove that…

For any natural number $d$, a graph $G$ is a (disjoint) $d$-interval graph if it is the intersection graph of (disjoint) $d$-intervals, the union of $d$ (disjoint) intervals on the real line. Two important subclasses of $d$-interval graphs…