The product of two high-frequency graph Laplacian eigenfunctions is smooth
From MaRDI portal
(Redirected from Publication:2111909)
Abstract: In the continuous setting, we expect the product of two oscillating functions to oscillate even more (generically). On a graph , there are only eigenvectors of the Laplacian , so one oscillates `the most'. The purpose of this short note is to point out an interesting phenomenon: if are delocalized eigenvectors of corresponding to large eigenvalues, then their (pointwise) product is smooth (in the sense of small Dirichlet energy): highly oscillatory functions have largely matching oscillation patterns.
Recommendations
- Laplacian spectral characterization of some graph products
- Laplacian spectral characterization of some graphs obtained by product operation
- On the Laplacian spectra of product graphs
- On the spectral resolution of products of Laplacian eigenfunctions
- Approximating pointwise products of Laplacian eigenfunctions
- Products of graphs and Nordhaus-Gaddum type inequalities for eigenvalues
- scientific article; zbMATH DE number 5283261
- On the spectral density function of the Laplacian of a graph
- Eigenfunctions of the edge-based Laplacian on a graph
- Eigenvalues of Graphs and Sobolev Inequalities
Cites work
- scientific article; zbMATH DE number 703988 (Why is no real title available?)
- scientific article; zbMATH DE number 7626797 (Why is no real title available?)
- scientific article; zbMATH DE number 4193718 (Why is no real title available?)
- scientific article; zbMATH DE number 3349875 (Why is no real title available?)
- Analytic continuation of representations and estimates of automorphic forms
- Approximating pointwise products of Laplacian eigenfunctions
- Approximating pointwise products of quasimodes
- Bounds on graph eigenvalues. I
- Eigenvalue bounds for independent sets
- Holomorphic extensions of representations. I: Automorphic functions
- Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
- Laplacian eigenvalues and the maximum cut problem
- Max cut and the smallest eigenvalue
- Numerical methods for Kohn–Sham density functional theory
- On Hamiltonian Circuits
- On planar hypohamiltonian graphs
- On the dual geometry of Laplacian eigenfunctions
- On the spectral resolution of products of Laplacian eigenfunctions
- Planar and infinite hypohamiltonian and hypotraceable graphs
- Planar cubic hypohamiltonian and hypotraceable graphs
This page was built for publication: The product of two high-frequency graph Laplacian eigenfunctions is smooth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2111909)