Related papers: Bratteli--Vershik models and graph covering models
We generalize the notion of an inverse sequence of graph covers from the zero-dimensional dynamical systems to any dynamical system.
Working in any model theoretic structure, we single out a class of definable bipartite graphs that admit definable, close to perfect matchings. We use this result to prove a strengthening of Tarski's theorem for the definable setting.
In this letter we study the NP-complete vertex cover problem on finite connectivity random graphs. When the allowed size of the cover set is decreased, a discontinuous transition in solvability and typical-case complexity occurs. This…
The increasing availability of network data has driven the development of advanced statistical models specifically designed for metric graphs, where Gaussian processes play a pivotal role. While models such as Whittle-Mat\'ern fields have…
We introduce a graph-theoretic vertex dissolution model that applies to a number of redistribution scenarios such as gerrymandering in political districting or work balancing in an online situation. The central aspect of our model is the…
In another article we associated a dynamical system to a non-properly ordered Bratteli diagram. In this article we describe how to compute the $K-$group $K_0$ of the dynamical system in terms of the Bratteli diagram. In the case of properly…
We give sufficient conditions for stability of a continuous-time linear switched system consisting of finitely many subsystems. The switching between subsystems is governed by an underlying graph. The results are applicable to switched…
In this work, we propose a non-parametric technique for online modeling of systems with unknown nonlinear Lipschitz dynamics. The key idea is to successively utilize measurements to approximate the graph of the state-update function using…
We introduce and study dynamical systems and measures on stationary generalized Bratteli diagrams $B$ that are represented as the union of countably many classical Pascal-Bratteli diagrams. We describe all ergodic tail invariant measures on…
We introduce uniformly vertex-transitive graphs as vertex-transitive graphs satisfying a stronger condition on their automorphism groups, motivated by a problem which arises from a Sinkhorn-type algorithm. We use the derangement graph…
We generalise the standard constructions of a Cayley graph in terms of a group presentation by allowing some vertices to obey different relators than others. The resulting notion of presentation allows us to represent every vertex…
An emerging way of tackling the dimensionality issues arising in the modeling of a multivariate process is to assume that the inherent data structure can be captured by a graph. Nevertheless, though state-of-the-art graph-based methods have…
Dynamic graphs provide a flexible data abstraction for modelling many sorts of real-world systems, such as transport, trade, and social networks. Graph neural networks (GNNs) are powerful tools allowing for different kinds of prediction and…
Graph embeddings have emerged as a powerful tool for representing complex network structures in a low-dimensional space, enabling the use of efficient methods that employ the metric structure in the embedding space as a proxy for the…
We study a model of fully-packed dimer configurations (or perfect matchings) on a bipartite periodic graph that is two-dimensional but not planar. The graph is obtained from $\mathbb Z^2$ via the addition of an extensive number of extra…
We introduce a class of integrable dynamical systems of interacting classical matrix-valued fields propagating on a discrete space-time lattice, realized as many-body circuits built from elementary symplectic two-body maps. The models…
Gr\"otschel, Lov\'asz, and Schrijver generalized the Lov\'asz $\vartheta$ function by allowing a weight for each vertex. We provide a similar generalization of Duan, Severini, and Winter's $\tilde{\vartheta}$ on non-commutative graphs.…
In this article we define a minor relation, which is stronger than the classical one, but too strong to become a well-quasi-order on the class of finite graphs. Nevertheless, with this terminology we are able to introduce a conjecture,…
Understanding and interacting with everyday physical scenes requires rich knowledge about the structure of the world, represented either implicitly in a value or policy function, or explicitly in a transition model. Here we introduce a new…
We introduce and study a class of exchangeable random graph ensembles. They can be used as statistical null models for empirical networks, and as a tool for theoretical investigations. We provide general theorems that carachterize the…