Diffuse scattering on graphs
DOI10.1016/j.laa.2016.01.012zbMath1331.05207arXiv1401.4428MaRDI QIDQ5965387
Jeremy G. Hoskins, Anna C. Gilbert, John C. Schotland
Publication date: 3 March 2016
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.4428
graph algorithms; discrete mathematics in relation to computer science; equations of mathematical physics; graphs and groups; graphs and matrices
68R10: Graph theory (including graph drawing) in computer science
05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
35Q99: Partial differential equations of mathematical physics and other areas of application
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Overdetermined partial boundary value problems on finite networks
- Dirichlet finite solutions of Poisson equations on an infinite network
- Discrete scattering theory: Green's function for a square lattice
- Modèles finis en théorie du potentiel
- Espaces de Dirichlet. I: Le cas élémentaire
- Potential theory on infinite networks
- Heat kernel and Green kernel comparison theorems for infinite graphs
- Discrete Green's functions
- Solving boundary value problems on networks using equilibrium measures
- Random sorting networks
- Discrete elliptic operators and their Green operators
- Potential theory for Schrödinger operators on finite networks
- Green matrices associated with generalized linear polyominoes
- Perturbations of discrete elliptic operators
- Discrete potential theory
- Optical tomography: forward and inverse problems
- Eigenvalues, eigenfunctions and Green's functions on a path via Chebyshev polynomials
- Facets of the linear ordering polytope
- Spectra of the Discrete and Continuous Laplacians on Graphs and Riemannian Manifolds.
- Spanning trees of graphs on surfaces and the intensity of loop-erased random walk on planar graphs
- Lx = b
- A Nearly-m log n Time Solver for SDD Linear Systems
