SUPERSYMMETRY ON GRAPHS AND NETWORKS
From MaRDI portal
Publication:5709201
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Applications of operator theory in the physical sciences (47N50) Spectral problems; spectral geometry; scattering theory on manifolds (58J50) Supersymmetric field theories in quantum mechanics (81T60) Special classes of linear operators (47B99)
Abstract: We show that graphs, networks and other related discrete model systems carry a natural supersymmetric structure, which, apart from its conceptual importance as to possible physical applications, allows to derive a series of spectral properties for a class of graph operators which typically encode relevant graph characteristics.
Recommendations
Cites work
- scientific article; zbMATH DE number 3536764 (Why is no real title available?)
- scientific article; zbMATH DE number 3445271 (Why is no real title available?)
- scientific article; zbMATH DE number 3075404 (Why is no real title available?)
- A Survey on Spectra of infinite Graphs
- A geometric renormalization group in discrete quantum space–time
- Analysis on graphs and noncommutative geometry
- Dirac operators and the calculation of the Connes metric on arbitrary (infinite) graphs
- Ground state structure in supersymmetric quantum mechanics
- The spectrum of an infinite graph
Cited in
(6)- Network and Seiberg duality
- An introduction to a supersymmetric graph algebra
- SPECTRAL PROPERTIES AND SYMMETRIES OF DOUBLE COVERINGS OF GRAPHS WITH APPLICATIONS TO SUPERCONDUCTIVITY
- Simple models in supersymmetric quantum mechanics on a graph
- Pregeometric concepts on graphs and cellular networks as possible models of space-time at the Planck-scale
- THE CONTINUUM LIMIT OF DISCRETE GEOMETRIES
This page was built for publication: SUPERSYMMETRY ON GRAPHS AND NETWORKS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5709201)