Families of isospectral and isoscattering quantum graphs

Abstract

A concept of germ graphs and the M-function formalism are employed to construct large families of isospectral and isoscattering graphs. This approach represents a complete departure from the original approach pioneered by Sunada, where isospectral graphs are obtained as quotients of a certain large symmetric graph. Using the M-function formalism and the symmetries of the graph itself we construct isospectral and isoscattering pairs. In our novel approach isospectral pairs do not need to be embedded into a larger symmetric graph as in Sunada's approach. We demonstrate that the introduced formalism can also be extended to graphs with dissipation. The theoretical predictions are validated experimentally using microwave networks emulating open quantum graphs with dissipation.

References in corpus (9)

• Are Scattering Properties of Graphs Uniquely Connected to Their Shapes?
• Power spectrum analysis and missing level statistics of microwave graphs with violated time reversal invariance
• Statistics of Impedance, Local Density of States, and Reflection in Quantum Chaotic Systems with Absorption
• The Isospectral Fruits of Representation Theory: Quantum Graphs and Drums
• Universal statistics of the local Green's function in quantum chaotic systems with absorption
• Non-Weyl Microwave Graphs
• A Random Necklace Model
• Departure of some parameter-dependent spectral statistics of irregular quantum graphs from Random Matrix Theory predictions
• Resonances and poles in isoscattering microwave networks and graphs