Supersymmetry on Graphs and Networks
Manfred Requardt
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.
Create a lesson
Related papers
On the Geometric Structure of Hyperbolic Clifford Bundles and Associated Spin Groups
Eduardo Notte-Cuello
Koopman-von Neumann formalism meets contact Hamiltonian systems
Federico Zadra
Lossless propagation bounds for long-range fermionic interactions
Stefan Teufel
Supersymmetric Neuromorphic FitzHugh--Nagumo model
D. Maroulakos, A. Wal, S. K. Mishra et al.
Separatrix splitting in a multiferroic neuromorphic oscillator: toward Arnold diffusion
D. Maroulakos, Z. Toklikishvili, A. Wal et al.
Anderson localisation in infinite and finite resonator crystals with long-range interactions
Habib Ammari, Xin Fu, Wenjia Jing et al.