Related papers: A Nonvanishing Spectral Gap for AKLT Models on Gen…

Under the widely accepted but unproven assumption that the one-dimensional S=1 antiferromagnetic Heisenberg model has a unique gapped ground state, we prove that the model belongs to a nontrivial symmetry-protected topological (SPT) phase.…

Graph spectra are an important class of structural features on graphs that have shown promising results in enhancing Graph Neural Networks (GNNs). Despite their widespread practical use, the theoretical understanding of the power of…

A $k$-matching of a graph $G$ is a function $f:E(G)\rightarrow\{0,1,2,\ldots,k\}$ with $\sum\limits_{e\in E_G(v)}f(e)\leq k$ for each vertex $v$ of $G$, where $E_G(v)$ is the set of edges incident with $v$ in $G$. A perfect $k$-matching of…

The possibility of topological phase transition with or without a magnetic flux trapped in the cells of a class of decorated lattices is explored in details.Using a tight binding Hamiltonian and a real space decimation scheme we…

The spectral gap for Laplace operators on metric graphs is investigated in relation to graph's connectivity, in particular what happens if an edge is added to (or deleted from) a graph. It is shown that in contrast to discrete graphs…

We show topological configurations of the complex-valued spectra in gapped non-Hermitian systems. These arise when the distinctive EPs in the energy Riemann sheets of such models are annihilated after threading them across the boundary of…

Graph Neural Networks (GNNs) have achieved remarkable success in various graph-based learning tasks. While their performance is often attributed to the powerful neighborhood aggregation mechanism, recent studies suggest that other…

This paper analyzes neural networks through graph variables and statistical sufficiency. We interpret neural network layers as graph-based transformations, where neurons act as pairwise functions between inputs and learned anchor points.…

In arXiv:1911.08172 we have studied the single-particle free energy of a class of Little String Theories of A-type, which are engineered by $N$ parallel M5-branes on a circle. To leading instanton order (from the perspective of the low…

A $k$-star colouring of a graph $G$ is a function $f:V(G)\to\{0,1,\dots,k-1\}$ such that $f(u)\neq f(v)$ for every edge $uv$ of $G$, and every bicoloured connected subgraph of $G$ is a star. The star chromatic number of $G$, $\chi_s(G)$, is…

State-of-the-art Graph Neural Networks (GNNs) have limited scalability with respect to the graph and model sizes. On large graphs, increasing the model depth often means exponential expansion of the scope (i.e., receptive field). Beyond…

The problem of characterizing graphs determined by their spectrum (DS) or generalized spectrum (DGS) has been a longstanding topic of interest in spectral graph theory, originating from questions in chemistry and mathematical physics. While…

For a simple graph G = (V, E) and a positive integer k greater than or equal to 2, a coloring of vertices of G using exactly k colors such that every vertex has an equal number of vertices of each color in its closed neighborhood is called…

We study the structure of entanglement in a supersymmetric lattice model of fermions on certain types of decorated graphs with quenched disorder. In particular, we construct models with controllable ground state degeneracy protected by…

A 3d symmetry protected topological phase, by definition must have symmetry protected nontrivial boundary states, namely its 2d boundary must be either gapless or degenerate. In this work we demonstrate that once we couple a 3d SPT phase to…

Let $G_S$ be a graph with loops obtained from a graph $G$ of order $n$ and loops at $S \subseteq V(G)$. In this paper, we establish a neccesary and sufficient condition on the bipartititeness of a connected graph $G$ and the spectrum…

Word-representable graphs, characterized by the existence of a semi-transitive orientation, form a well-studied class of graphs. Comparability graphs form another well-studied class and constitute a subclass of word-representable graphs.…

For a graph G and an integer t we let mcc_t(G) be the smallest m such that there exists a coloring of the vertices of G by t colors with no monochromatic connected subgraph having more than m vertices. Let F be any nontrivial minor-closed…

A graph $G$ is $F$-free if $G$ does not contain $F$ as a subgraph. Let $\mathcal{G}(m, F)$ denote the family of $F$-free graphs with $m$ edges and without isolated vertices. Let $S_{n,k}$ denote the graph obtained by joining every vertex of…

We characterize the computational power of neural networks that follow the graph neural network (GNN) architecture, not restricted to aggregate-combine GNNs or other particular types. We establish an exact correspondence between the…