Related papers: BPS Graphs: From Spectral Networks to BPS Quivers
In study of four-dimensional BPS states, quiver quantum mechanics plays a central role. The Coulomb phases capture the multi-centered nature of such states, and are well understood in the context of wall-crossing. The Higgs phases are given…
Spectral graph bisections are a popular heuristic aimed at approximating the solution of the NP-complete graph bisection problem. This technique, however, does not always provide a robust tool for graph partitioning. Using a special class…
We propose a systematic approach to computing the BPS spectra of any 5d/6d supersymmetric quantum field theory in Coulomb phases, which admits either gauge theory descriptions or geometric descriptions, based on the Nakajima-Yoshioka's…
We study geometric presentations of braid groups for particles that are constrained to move on a graph, i.e. a network consisting of nodes and edges. Our proposed set of generators consists of exchanges of pairs of particles on junctions of…
Network topology inference is a prominent problem in Network Science. Most graph signal processing (GSP) efforts to date assume that the underlying network is known, and then analyze how the graph's algebraic and spectral characteristics…
Contributing to the rigorous understanding of BP, in this paper we relate the convergence of BP to spectral properties of the graph. This encompasses a result for random graphs with a ``planted'' solution; thus, we obtain the first rigorous…
We show that general string-net condensed states have a natural representation in terms of tensor product states (TPS) . These TPS's are built from local tensors. They can describe both states with short-range entanglement (such as the…
The spectral excess theorem for distance-regular graphs states that a regular (connected) graph is distance-regular if and only if its spectral-excess equals its average excess. A bipartite graph is distance-biregular when it is…
In his PhD Thesis, E.R. Scheinerman conjectured that planar graphs are intersection graphs of line segments in the plane. This conjecture was proved with two different approaches by J. Chalopin and the author, and by the author, L.…
In graph signal processing (GSP), prior information on the dependencies in the signal is collected in a graph which is then used when processing or analyzing the signal. Blind source separation (BSS) techniques have been developed and…
Persistent homology is constrained to purely topological persistence while multiscale graphs account only for geometric information. This work introduces persistent spectral theory to create a unified low-dimensional multiscale paradigm for…
We classify, in a group theoretical manner, the BPS configurations in the multiple M2-brane theory recently proposed by Bagger and Lambert. We present three types of BPS equations preserving various fractions of supersymmetries: in the…
In this article we are introducing combinatorial spectra of graphs, this is a generalization of $H$-Hamiltonian spectra. The main motivation was to made from $H$-Hamiltonian spectra an operation and develop some algebra in this field. An…
We study the Coulomb branches of the rank-one 4d $\mathcal{N} = 2$ quantum field theories, including the KK theories obtained from the circle compactification of the 5d $\mathcal{N}= 1$ $E_n$ Seiberg theories. The focus is set on the…
State surfaces are spanning surfaces of links that are obtained from link diagrams guided by the combinatorics underlying Kauffman's construction of the Jones polynomial via state models. Geometric properties of such surfaces are often…
We study BPS domain walls of N=1 supergravity coupled to a chiral multiplet and their Lorentz invariant vacua which can be viewed as critical points of BPS equations and the scalar potential. Supersymmetry further implies that gradient…
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…
Statistical analysis of a graph often starts with embedding, the process of representing its nodes as points in space. How to choose the embedding dimension is a nuanced decision in practice, but in theory a notion of true dimension is…
Expander graphs are widely used in communication problems and construction of error correcting codes. In such graphs, information gets through very quickly. Typically, it is not true for social or biological networks, though we may find a…
Graph neural networks (GNNs) have attracted considerable attention from the research community. It is well established that GNNs are usually roughly divided into spatial and spectral methods. Despite that spectral GNNs play an important…