Related papers: ADE Spectral Networks
It is well known that the spectral radius of a tree whose maximum degree is D cannot exceed 2sqrt{D-1}. Similar upper bound holds for arbitrary planar graphs, whose spectral radius cannot exceed sqrt{8D}+10, and more generally, for all…
We propose a general approach to the description of spectra of complex networks. For the spectra of networks with uncorrelated vertices (and a local tree-like structure), exact equations are derived. These equations are generalized to the…
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 study the decomposition of 4d $\mathcal{N}=1$ gauge theories with Lie algebras of type $\mathfrak{su}(N)$, $\mathfrak{so}(2N)$, and $\mathfrak{e}_{6}$, realized via M-theory geometric engineering. These theories, together with their…
We conjecture a formula for the Schur index of four-dimensional $\mathcal{N}=2$ theories coupled to $(2,2)$ surface defects in terms of the $2d$-$4d$ BPS spectrum in the Coulomb phase of the theory. The key ingredient in our conjecture is a…
BPS states in N=4 supersymmetric SU(N) gauge theories in four dimensions can be represented as planar string networks with ends lying on D3-branes. We introduce several protected indices which capture information on the spectrum and various…
The BPS spectrum of certain N=2 supersymmetric field theories can be determined algebraically by studying the representation theory of BPS quivers. We introduce methods based on BPS quivers to study line defects. The presence of a line…
Graph neural networks have developed by leaps and bounds in recent years due to the restriction of traditional convolutional filters on non-Euclidean structured data. Spectral graph theory mainly studies fundamental graph properties using…
This review presents an account of the major works done on spectra of adjacency matrices drawn on networks and the basic understanding attained so far. We have divided the review under three sections: (a) extremal eigenvalues, (b) bulk part…
Network science provides a universal framework for modeling complex systems, contrasting the reductionist approach generally adopted in physics. In a prototypical study, we utilize network models created from spectroscopic data of atoms to…
We propose generating functions which encode the degeneracies and wall-crossing phenomena of $\mathcal{N}=2$ BPS structures. The generating functions have a representation-theoretic origin and are the analogs of the 1/4-BPS dyon counting…
We obtain a large class of new 4d Argyres-Douglas theories by classifying irregular punctures for the 6d (2,0) superconformal theory of ADE type on a sphere. Along the way, we identify the connection between the Hitchin system and…
It is pointed out that affine Lie algebras appear to be the natural mathematical structure underlying the notion of integrability for two-dimensional systems. Their role in the construction and classification of 2D integrable systems is…
We derive a message passing method for computing the spectra of locally tree-like networks and an approximation to it that allows us to compute closed-form expressions or fast numerical approximates for the spectral density of random graphs…
The analysis of the dynamics on complex networks is closely connected to structural features of the networks. Features like, for instance, graph-cores and node degrees have been studied ubiquitously. Here we introduce the D-spectrum of a…
We consider a class of random graphs, called random brushes, which are constructed by adding linear graphs of random lengths to the vertices of Z^d viewed as a graph. We prove that for d=2 all random brushes have spectral dimension d_s=2.…
For a network consisting of a graph with edge weights prescribed by a given conductance function $c$, we consider the effects of replacing these weights with a new function $b$ that satisfies $b \leq c$ on each edge. In particular, we…
BPS spectrum with finite number of states are found for higher rank four dimensional N=2 theory engineered from six dimensional A_{N-1} (2,0) theory on a Riemann surface with various kinds of defects. The wall crossing formula is…
We give generators and relations for the planar algebras corresponding to $ADE$ subfactors. We also give a basis and an algorithm to express an arbitrary diagram as a linear combination of these basis diagrams.
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…