相关论文: On Lambda-Graph Systems for Subshifts of Subshifts

Graph neural networks (GNNs) have shown advantages in graph-based analysis tasks. However, most existing methods have the homogeneity assumption and show poor performance on heterophilic graphs, where the linked nodes have dissimilar…

In this paper we calculate the metric and folding entropies for a family of non-invertible symbolic dynamical systems $(\Sigma_{m_-,m_+}, \sigma_\phi)$ which generalizes the standard bilateral Bernoulli shifts. The space $\Sigma_{m_-,m_+}$…

Graph classification plays an important role is data mining, and various methods have been developed recently for classifying graphs. In this paper, we propose a novel method for graph classification that is based on homotopy equivalence of…

We develop a $\kappa$-symmetry calculus for the d=2 and d=3, N=2 massive superparticles, which enables us to construct higher order $\kappa$-invariant actions. The method relies on a reformulation of these models as supersymmetric sigma…

Let $\Gamma$ be a finite graph and let $\Gamma^{\mathrm{e}}$ be its extension graph. We inductively define a sequence $\{\Gamma_i\}$ of finite induced subgraphs of $\Gamma^{\mathrm{e}}$ through successive applications of an operation called…

Local correlation entropy, introduced by Takens in 1983, represents the exponential decay rate of the relative frequency of recurrences in the trajectory of a point, as the embedding dimension grows to infinity. In this paper we study…

We introduce the notion of metric entropy for a nonautonomous dynamical system given by a sequence of probability spaces and a sequence of measure-preserving maps between these spaces. This notion generalizes the classical concept of metric…

Graph symmetries intervene in diverse applications, from enumeration, to graph structure compression, to the discovery of graph dynamics (e.g., node arrival order inference). Whereas Erd\H{o}s-R\'enyi graphs are typically asymmetric, real…

Explaining graph neural networks (GNNs) has become more and more important recently. Higher-order interpretation schemes, such as GNN-LRP (layer-wise relevance propagation for GNN), emerged as powerful tools for unraveling how different…

The paper gives a characterisation of the chain relation of a sofic subshift. Every sofic subshift $\Sigma$ can be described by a labelled graph $G$. Factorising $G$ in a suitable way we obtain the graph $G/_\approx$ that offers insight…

For a set $\Gamma$, a function $\lambda:\Gamma\to \Gamma$ and a non-trivial abelian group $K$, the generalized shift $\sigma_\lambda:K^\Gamma\to K^\Gamma$ is defined by $(x_i)_{i\in \Gamma}\mapsto (x_{\lambda(i)})_{i\in\Gamma}$. In this…

Hypergraphs have emerged as a powerful modeling framework to represent systems with multiway interactions, that is systems where interactions may involve an arbitrary number of agents. Here we explore the properties of real-world…

This work studies the relation between two graph parameters, $\rho$ and $\Lambda$. For an undirected graph $G$, $\rho(G)$ is the growth rate of its universal covering tree, while $\Lambda(G)$ is a weighted geometric average of the vertex…

Multi-graph learning is crucial for extracting meaningful signals from collections of heterogeneous graphs. However, effectively integrating information across graphs with differing topologies, scales, and semantics, often in the absence of…

Graph matching refers to finding node correspondence between graphs, such that the corresponding node and edge's affinity can be maximized. In addition with its NP-completeness nature, another important challenge is effective modeling of…

Quantum graphity is a background independent model for emergent locality, spatial geometry and matter. The states of the system correspond to dynamical graphs on N vertices. At high energy, the graph describing the system is highly…

Entity alignment is a crucial task in knowledge graph fusion. However, most entity alignment approaches have the scalability problem. Recent methods address this issue by dividing large KGs into small blocks for embedding and alignment…

Graph C*-algebras have been celebrated as C*-algebras that can be seen, because many important properties may be determined by looking at the underlying graph. This paper introduces the permutation graph for a permutative endomorphism of a…

There is much recent interest in understanding the density at which constant size graphs can appear in a very large graph. Specifically, the inducibility of a graph H is its extremal density, as an induced subgraph of G, where |G| ->…

We propose the Lanczos network (LanczosNet), which uses the Lanczos algorithm to construct low rank approximations of the graph Laplacian for graph convolution. Relying on the tridiagonal decomposition of the Lanczos algorithm, we not only…