相关论文: BPS spectra from BPS graphs
We study the BPS spectrum of four dimensional N=2 SU(2) theory with massive fundamental matters using the D3-brane probe. Since the BPS states are realized by string webs subject to the BPS conditions, we determine explicitly the…
It is not hard to find many complete bipartite graphs which are not determined by their spectra. We show that the graph obtained by deleting an edge from a complete bipartite graph is determined by its spectrum. We provide some graphs, each…
We study the transmission of a quantum particle along a straight input--output line to which a graph $\Gamma$ is attached at a point. In the point of contact we impose a singularity represented by a certain properly chosen scale-invariant…
We present a detailed study of the analytic structure, BPS spectra and superconformal points of the $ N=2 $ susy $ SU(2) $ gauge theories with $ N_f=1,2,3 $ massive quark hypermultiplets. We compute the curves of marginal stability with the…
We study a family of closed quantum graphs described by one singular vertex of order n=4. By suitable choice of the parameters specifying the singular vertex, we can construct a closed sequence of paths in the parameter space that…
We study the BPS particle spectrum of five-dimensional superconformal field theories (SCFTs) on $\mathbb{R}^4\times S^1$ with one-dimensional Coulomb branch, by means of their associated BPS quivers. By viewing these theories as arising…
Quantum walks in general graphs, or more specifically scattering on graphs, encompass enough complexity to perform universal quantum computation. Any given quantum circuit can be broken down into single- and two-qubit gates, which can then…
In the past decades, graphs that are determined by their spectrum have received more attention, since they have been applied to several fields, such as randomized algorithms, combinatorial optimization problems and machine learning. An…
Representing data residing on a graph as a linear combination of building block signals can enable efficient and insightful visual or statistical analysis of the data, and such representations prove useful as regularizers in signal…
Regular and distance-regular characterizations of general graphs are well-known. In particular, the spectral excess theorem states that a connected graph G is distance-regular if and only if its spectral excess (a number that can be…
By assigning a probability measure via the spectrum of the normalized Laplacian to each graph and using L^p Wasserstein distances between probability measures, we define the corresponding spectral distances d_p on the set of all graphs.…
In a series of two papers we investigate the universal spectral statistics of chaotic quantum systems in the ten known symmetry classes of quantum mechanics. In this first paper we focus on the construction of appropriate ensembles of star…
We give a physical explanation of the Kontsevich-Soibelman wall-crossing formula for the BPS spectrum in Seiberg-Witten theories. In the process we give an exact description of the BPS instanton corrections to the hyperkahler metric of the…
A variety of network modeling problems begin by generating a degree sequence drawn from a given probability distribution. If the randomly generated sequence is not graphic, we give a new approach for generating a graphic approximation of…
We construct infinite families of graphs in which pretty good state transfer can be induced by adding a potential to the nodes of the graph (i.e. adding a number to a diagonal entry of the adjacency matrix). Indeed, we show that given any…
Breadth First Search (BFS) and other graph traversal techniques are widely used for measuring large unknown graphs, such as online social networks. It has been empirically observed that an incomplete BFS is biased toward high degree nodes.…
The spectra of BPS states in F-theory on elliptic fibred fourfolds are investigated.
Type IIB string theory admits a BPS configuration in which three strings (of different type) meet at a point. Using this three string configuration we construct a string network and study its properties. In particular we prove supersymmetry…
A graph $G$ is said to be determined by its generalized spectrum (DGS for short) if for any graph $H$, $H$ and $G$ are cospectral with cospectral complements implies that $H$ is isomorphic to $G$. It turns out that whether a graph $G$ is…
Cluster coordinates for a large class of Argyres-Douglas and asymptotical free theories are constructed using network on bordered Riemann surface. Such N = 2 theories are engineered using six dimensional (2, 0) theory on Riemann surface…