Related papers: On Lambda-Graph Systems for Subshifts of Subshifts
In his classical work, Kuramoto analytically described the onset of synchronization in all-to-all coupled networks of phase oscillators with random intrinsic frequencies. Specifically, he identified a critical value of the coupling…
We consider the problem of constructing embeddings of large attributed graphs and supporting multiple downstream learning tasks. We develop a graph embedding method, which is based on extending deep metric and unbiased contrastive learning…
In this paper, we introduce topological entropy for dynamical systems generated by a single local homeomorphism (Deaconu-Renault systems). More precisely, we generalize Adler, Konheim, and McAndrew's definition of entropy via covers and…
Omega-limit sets play an important role in one-dimensional dynamics. During last fifty year at least three definitions of basic set has appeared. Authors often use results with different definition. Here we fill in the gap of missing proof…
The graph entropy describes the structural information of graph. Motivated by the definition of graph entropy in general graphs, the graph entropy of hypergraphs based on Laplacian degree are defined. Some results on graph entropy of simple…
Nonlinear dynamics play an important role in the analysis of signals. A popular, readily interpretable nonlinear measure is Permutation Entropy. It has recently been extended for the analysis of graph signals, thus providing a framework for…
It is challenging for generative models to learn a distribution over graphs because of the lack of permutation invariance: nodes may be ordered arbitrarily across graphs, and standard graph alignment is combinatorial and notoriously…
Let $ \Phi=(G, \varphi) $ be a connected complex unit gain graph ($ \mathbb{T} $-gain graph) on a simple graph $ G $ with $ n $ vertices and maximum vertex degree $ \Delta $. The associated adjacency matrix and degree matrix are denoted by…
We generalize Brudno's theorem of $1$-dimensional shift dynamical system to $\mathbb{Z}^d$ (or $\mathbb{Z}_+^d$) subshifts. That is to say, in $\mathbb{Z}^d$ (or $\mathbb{Z}^d_+$) subshift, the Kolmogorov-Sinai entropy is equivalent to the…
We introduce two variations of the cops and robber game on graphs. These games yield two invariants in $\mathbb{Z}_+\cup\{\infty\}$ for any connected graph $\Gamma$, the {weak cop number $\mathsf{wcop}(\Gamma)$} and the {strong cop number…
After a brief survey of the definition and the properties of Lambda-symmetries in the general context of dynamical systems, the notion of "Lambda-constant of motion'' for Hamiltonian equations is introduced. If the Hamiltonian problem is…
To a singular knot K with n double points, one can associate a chord diagram with n chords. A chord diagram can also be understood as a 4-regular graph endowed with an oriented Euler circuit. L. Traldi introduced a polynomial invariant for…
The joint convexity of the map $(X,A) \mapsto X^* A^{-1} X$, an integral representation of operator convex functions, and an observation of Ando are used to obtain a simple proof of both the joint convexity of relative entropy and a trace…
We give a characterization of distance--preserving subgraphs of Johnson graphs, i.e. of graphs which are isometrically embeddable into Johnson graphs (the Johnson graph $J(m,\Lambda)$ has the subsets of cardinality $m$ of a set $\Lambda$ as…
We propose a novel variational method for solving the sub-graph isomorphism problem on a gate-based quantum computer. The method relies (1) on a new representation of the adjacency matrices of the underlying graphs, which requires a number…
Looped Transformers have shown exceptional neural algorithmic reasoning capability in simulating traditional graph algorithms, but their application to more complex structures like hypergraphs remains underexplored. Hypergraphs generalize…
Topological entropy or spatial entropy is a way to measure the complexity of shift spaces. This study investigates the relationships between the spatial entropy and the various periodic entropies which are computed by skew-coordinated…
Scene graphs are a powerful structured representation of the underlying content of images, and embeddings derived from them have been shown to be useful in multiple downstream tasks. In this work, we employ a graph convolutional network to…
A graph $G$ is called \emph{symmetric with respect to a functional $F_G(P)$} defined on the set of all the probability distributions on its vertex set if the distribution $P^*$ maximizing $F_G(P)$ is uniform on $V(G)$. Using the…
We investigate topological, combinatorial, statistical, and enumeration properties of finite graphs with high Kolmogorov complexity (almost all graphs) using the novel incompressibility method. Example results are: (i) the mean and variance…