Related papers: BPS spectra from BPS graphs
The distance matrix of a connected graph is the symmetric matrix with columns and rows indexed by the vertices and entries that are the pairwise distances between the corresponding vertices. We give a construction for graphs which differ in…
Predator-prey networks originating from different aqueous and terrestrial environments are compared to assess if the difference in environments of these networks produce any significant difference in the structure of such predator-prey…
We investigate spectral properties of quantum graphs in the form of a periodic chain of rings with a connecting link between each adjacent pair, assuming that wave functions at the vertices are matched through conditions manifestly…
The BPS method is used to find BPS solutions of the worldvolume theory of a D5-brane in the near horizon geometry of a D3-brane. The BPS bound is interpreted in terms of the `maximally extended' D5 worldvolume supersymmetry algebra in the…
We study the BPS states of a D6-brane wrapping the conifold and bound to collections of D2 and D0 branes. We find that in addition to the complexified Kahler parameter of the rigid sphere it is necessary to introduce an extra real parameter…
We study BPS $q$-series associated to 3-manifolds decorated by a line defect along an embedded link. We prove that these $q$-series depend only on the class of the link in the skein module, thereby defining a homomorphism from the skein…
The purpose of this paper is to analyze the Moore-Penrose pseudo-inversion of symmetric real matrices with application in the graph theory. We introduce a novel concept of positively and negatively pseudo-inverse matrices and graphs. We…
Graph structures are ubiquitous throughout the natural sciences. Here we consider graph-structured quantum data and describe how to carry out its quantum machine learning via quantum neural networks. In particular, we consider training data…
Spin networks, essentially labeled graphs, are ``good quantum numbers'' for the quantum theory of geometry. These structures encompass a diverse range of techniques which may be used in the quantum mechanics of finite dimensional systems,…
We investigate the spectrum of type IIA BPS D-branes on the quintic from a four dimensional supergravity perspective and the associated split attractor flow picture. We obtain some very concrete properties of the (quantum corrected)…
In this paper, we prove that every planar graph has a 1-string $B_2$-VPG representation---a string representation using paths in a rectangular grid that contain at most two bends. Furthermore, two paths representing vertices $u,v$ intersect…
This paper was inspired by a paper by Blokhuis and Brouwer [Designs, Codes and Cryptography 65, 2012] in which a definition of a graph on the flags of a biplane is given, and they prove that the graph corresponding to the unique…
Graph classification aims to categorise graphs based on their structure and node attributes. In this work, we propose to tackle this task using tools from graph signal processing by deriving spectral features, which we then use to design…
We propose a program for counting microstates of four-dimensional BPS black holes in N >= 2 supergravities with symmetric-space valued scalars by exploiting the symmetries of timelike reduction to three dimensions. Inspired by the…
We study the basic features of BPS quiver mutations in 4D $\mathcal{N}=2$ supersymmetric quantum field theory with $G=ADE$ gauge symmetries.\ We show, for these gauge symmetries, that there is an isotropy group $\mathcal{G}_{Mut}^{G}$…
Graph signal processing (GSP) is a framework to analyze and process graph-structured data. Many research works focus on developing tools such as Graph Fourier transforms (GFT), filters, and neural network models to handle graph signals.…
The study of spectral graph determination is a fascinating area of research in spectral graph theory and algebraic combinatorics. This field focuses on examining the spectral characterization of various classes of graphs, developing methods…
We consider quantum graphs with transparent branching points. To design such networks, the concept of transparent boundary conditions is applied to the derivation of the vertex boundary conditions for the linear Schrodinger equation on…
In this paper we focus on subsampling stationary random processes that reside on the vertices of undirected graphs. Second-order stationary graph signals are obtained by filtering white noise and they admit a well-defined power spectrum.…
Probabilistic breadth-first traversals (BPTs) are used in many network science and graph machine learning applications. In this paper, we are motivated by the application of BPTs in stochastic diffusion-based graph problems such as…