Related papers: A Nonvanishing Spectral Gap for AKLT Models on Gen…
We exactly evaluate the entanglement of a six vertex and a nine vertex graph states which correspond to non ''two-colorable'' graphs. The upper bound of entanglement for five vertices ring graph state is improved to 2.9275, less than upper…
Recent work at the intersection of formal language theory and graph theory has explored graph grammars for graph modeling. However, existing models and formalisms can only operate on homogeneous (i.e., untyped or unattributed) graphs. We…
We investigate two notions of saturation for partial planar embeddings of maximal planar graphs. Let $G = (V, E) $ be a vertex-labeled maximal planar graph on $ n $ vertices, which by definition has $3n - 6$ edges. We say that a labeled…
The Connected Vertex Cover problem is to decide if a graph G has a vertex cover of size at most $k$ that induces a connected subgraph of $G$. This is a well-studied problem, known to be NP-complete for restricted graph classes, and, in…
A graph $G$ has maximal local edge-connectivity $k$ if the maximum number of edge-disjoint paths between every pair of distinct vertices $x$ and $y$ is at most $k$. We prove Brooks-type theorems for $k$-connected graphs with maximal local…
For a given $\varepsilon > 0$, we say that a graph $G$ is $\varepsilon$-flexibly $k$-choosable if the following holds: for any assignment $L$ of color lists of size $k$ on $V(G)$, if a preferred color from a list is requested at any set $R$…
Standard Bell inequalities hold when distant parties are not allowed to communicate. Barrett et al. found correlations from Pauli measurements on certain network graphs refute a local hidden variable (LHV) description even allowing some…
We obtain an essential spectral gap for $n$-dimensional convex co-compact hyperbolic manifolds with the dimension $\delta$ of the limit set close to $(n-1)/2$. The size of the gap is expressed using the additive energy of stereographic…
We introduce exactly solvable gapless quantum systems in $d$ dimensions that support symmetry protected topological (SPT) edge modes. Our construction leads to long-range entangled, critical points or phases that can be interpreted as…
Let $(X,E_X)$ and $(V,E_V)$ be finite connected graphs without loops. We assume that $V$ has two distinguished vertices $a,b$ and an automorphism $\gamma$ which exchanges $a$ and~$b$. The $V$-edge substitution of $X$ is the graph $X[V]$…
Nonlinear spectral gaps with respect to uniformly convex normed spaces are shown to satisfy a spectral calculus inequality that establishes their decay along Cesaro averages. Nonlinear spectral gaps of graphs are also shown to behave…
We study gaps in the spectra of the adjacency matrices of large finite cubic graphs. It is known that the gap intervals $(2 \sqrt{2},3)$ and $[-3,-2)$ achieved in cubic Ramanujan graphs and line graphs are maximal. We give constraints on…
We analyze a class of quantum spin models defined on half-spaces in the $d$-dimensional hypercubic lattice bounded by a hyperplane with inward unit normal vector $m\in\mathbb{R}^d$. The family of models was previously introduced as the…
Due to the limited resources and the scale of the graphs in modern datasets, we often get to observe a sampled subgraph of a larger original graph of interest, whether it is the worldwide web that has been crawled or social connections that…
We discuss (1+1)d gapless phases with non-invertible global symmetries, also referred to as categorical symmetries. This includes gapless phases showing properties analogous to gapped symmetry protected topological (SPT) phases, known as…
Spectral analysis connects graph structure to the eigenvalues and eigenvectors of associated matrices. Much of spectral graph theory descends directly from spectral geometry, the study of differentiable manifolds through the spectra of…
We construct generalized Hofstadter models that possess "color-entangled" flat bands and study interacting many-body states in such bands. For a system with periodic boundary conditions and appropriate interactions, there exist gapped…
Quantum entanglement marks a definitive feature of topological states. However, the entanglement spectrum remains insufficiently explored for topological states without a bulk energy gap. Using a combination of field theory and numerical…
The Spectral Excess Theorem (SPET) for distance-regular graphs states that a regular (connected) graph is distance-regular if and only if its spectral-excess equals its average excess. Recently, some local or global approaches to the SPET…
When analyzing weighted networks using spectral embedding, a judicious transformation of the edge weights may produce better results. To formalize this idea, we consider the asymptotic behavior of spectral embedding for different…