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

Graph Transformers (GTs) have demonstrated great effectiveness across various graph analytical tasks. However, the existing GTs focus on training and testing graph data originated from the same distribution, but fail to generalize under…

The dynamics of symbolic systems, such as multidimensional subshifts of finite type or cellular automata, are known to be closely related to computability theory. In particular, the appropriate tools to describe and classify topological…

The implicit graph conjecture states that every sufficiently small, hereditary graph class has a labeling scheme with a polynomial-time computable label decoder. We approach this conjecture by investigating classes of label decoders defined…

The smallest eigenvalue of a graph is the smallest eigenvalue of its adjacency matrix. We show that the family of graphs with smallest eigenvalue at least $-\lambda$ can be defined by a finite set of forbidden induced subgraphs if and only…

We introduce a novel loss function for training deep learning architectures to perform classification. It consists in minimizing the smoothness of label signals on similarity graphs built at the output of the architecture. Equivalently, it…

In this work, we study the slow entropy type invariant of a dynamical system proposed by A. M. Vershik. We provide an explicit construction of a system whose class of scaling entropy sequences is empty. For this unstable case, we introduce…

We demonstrate how by using a reinforcement learning algorithm, the deep cross-entropy method, one can find explicit constructions and counterexamples to several open conjectures in extremal combinatorics and graph theory. Amongst the…

We investigate the asymptotic number of induced subgraphs in power-law uniform random graphs. We show that these induced subgraphs appear typically on vertices with specific degrees, which are found by solving an optimization problem.…

We consider families of finite quantum graphs of increasing size and we are interested in how eigenfunctions are distributed over the graph. As a measure for the distribution of an eigenfunction on a graph we introduce the entropy, it has…

The recent extension of permutation entropy and its derivatives to graph signals has opened up new horizons for the analysis of complex, high-dimensional systems evolving on networks. However, these measures are all fundamentally rooted in…

We associate all small subgraph counting problems with a systematic graph encoding/representation system which makes a coherent use of graphlet structures. The system can serve as a unified foundation for studying and connecting many…

We study the basic relation between skew-symmetric Lotka-Volterra systems and graphs, both at the level of objects and morphisms, and derive a classification from it of skew-symmetric Lotka-Volterra systems in terms of graphs as well as in…

Consider the random graph sampled uniformly from the set of all simple graphs with a given degree sequence. Under mild conditions on the degrees, we establish a Large Deviation Principle (LDP) for these random graphs, viewed as elements of…

The Kuramoto model is a classical mathematical model in the field of non-linear dynamical systems that describes the evolution of coupled oscillators in a network that may reach a synchronous state. The relationship between the network's…

We connect several notions relating the structural and dynamical properties of a graph. Among them are the topological entropy coming from the vertex shift, which is related to the spectral radius of the graph's adjacency matrix, the…

Using the weak convergence approach to large deviations, we formulate and prove the large deviation principle (LDP) for W-random graphs in the cut-norm topology. This generalizes the LDP for Erd\H{o}s-R{\' e}nyi random graphs by Chatterjee…

We develop a graph-based method to study the entanglement entropy of Calderbank-Shor-Steane quantum codes. This method offers a straightforward interpretation for the entanglement entropy of quantum error correcting codes through…

For any graph, we define a rank-1 operator on a bipartite tensor product space, with components associated to the set of vertices and edges respectively. We show that the partial traces of the operator are the Laplacian and the…

We present a series of statements about scaling entropy, a metric invariant of dynamical systems proposed by A. M. Vershik in the late 90's. We show that it is a metric invariant indeed and calculate it in several special cases.

We define link and graph invariants from entropic magmas modeling them on the Kauffman bracket and Tutte polynomial. We define the homology of entropic magmas. We also consider groups that can be assigned to the families of compatible…