Scattering solutions in a network of thin fibers: small diameter asymptotics

Abstract

Small diameter asymptotics is obtained for scattering solutions in a network of thin fibers. The asymptotics is expressed in terms of solutions of related problems on the limiting quantum graph. We calculate the Lagrangian gluing conditions at vertices for the problems on the limiting graph. If the frequency of the incident wave is above the bottom of the absolutely continuous spectrum, the gluing conditions are formulated in terms of the scattering data for each individual junction of the network.

References in corpus (2)

• Quantum graphs as holonomic constraints
• Transition from a network of thin fibers to the quantum graph: an explicitly solvable model

Cited by in corpus (17)

• Nontrivial edge coupling from a Dirichlet network squeezing: the case of a bent waveguide
• Leaky Quantum Graphs: A Review
• Convergence of resonances on thin branched quantum wave guides
• Eigenvalue inequalities and absence of threshold resonances for waveguide junctions
• Soliton transport in tubular networks: transmission at vertices in the shrinking limit
• Approximations of singular vertex couplings in quantum graphs
• Spectral stability of shifted states on star graphs
• A general approximation of quantum graph vertex couplings by scaled Schroedinger operators on thin branched manifolds
• The effect of disorder on the wave propagation in one-dimensional periodic optical systems
• On ${\delta }^{\prime }$-like potential scattering on star graphs
• Effective Schroedinger dynamics on $\epsilon$-thin Dirichlet waveguides via Quantum Graphs I: star-shaped graphs
• Diffusion processes in thin tubes and their limits on graphs
• Asymptotic approximation for the solution to a semi-linear parabolic problem in a thin star-shaped junction
• Quantum graphs: Coulomb-type potentials and exactly solvable models
• Wave propagation in periodic networks of thin fibers
• Physical approach to quantum networks with massive particles
• Nonlinear standing waves on planar branched systems: Shrinking into metric graph