Quantum graphs where back-scattering is prohibited
From MaRDI portal
Abstract: We describe a new class of scattering matrices for quantum graphs in which back-scattering is prohibited. We discuss some properties of quantum graphs with these scattering matrices and explain the advantages and interest in their study. We also provide two methods to build the vertex scattering matrices needed for their construction.
Recommendations
- Direct computation of scattering matrices for general quantum graphs
- Symmetries of quantum graphs and the inverse scattering problem
- Quantum ergodicity for quantum graphs without back-scattering
- Quantum graph vertices with permutation-symmetric scattering probabilities
- Quantum graphs: a simple model for chaotic scattering
Cited in
(17)- Quantum graph vertices with permutation-symmetric scattering probabilities
- Transparent quantum graphs
- The scattering matrix with respect to an Hermitian matrix of a graph
- On equi-transmitting matrices
- Some weighted Bartholdi zeta function of a digraph
- Quantum ergodicity for quantum graphs without back-scattering
- Weighted scattering matrices of regular coverings of graphs
- On reflectionless equi-transmitting matrices
- Hermitian unitary matrices with modular permutation symmetry
- Rényi and Tsallis entropies related to eigenfunctions of quantum graphs
- Maximal scarring for eigenfunctions of quantum graphs
- Complete dynamical evaluation of the characteristic polynomial of binary quantum graphs
- Degeneracy in the length spectrum for metric graphs
- Manakov system on metric graphs: modeling the reflectionless propagation of vector solitons in networks
- Direct computation of scattering matrices for general quantum graphs
- Quantizing graphs, one way or two?
- Scattering matrices of regular coverings of graphs
This page was built for publication: Quantum graphs where back-scattering is prohibited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5431399)
