• Corpus ID: 238419338

Laplacians on infinite graphs: discrete vs continuous

@inproceedings{Kostenko2021LaplaciansOI,
  title={Laplacians on infinite graphs: discrete vs continuous},
  author={Aleksey Kostenko and Noema Nicolussi},
  year={2021}
}
There are two main notions of a Laplacian operator associated with graphs: discrete graph Laplacians and continuous Laplacians on metric graphs (widely known as quantum graphs). Both objects have a venerable history as they are related to several diverse branches of mathematics and mathematical physics. The existing literature usually treats these two Laplacian operators separately. In this overview, we will focus on the relationship between them (spectral and parabolic properties). Our main… 

References

SHOWING 1-10 OF 80 REFERENCES
The spectrum of the continuous Laplacian on a graph
We study the spectrum of the continuous Laplacian Δ on a countable connected locally finite graph Γ without self-loops, whose edges have suitable positive conductances and are identified with copies
Spectral Theory of Infinite Quantum Graphs
We investigate quantum graphs with infinitely many vertices and edges without the common restriction on the geometry of the underlying metric graph that there is a positive lower bound on the lengths
Discrete Schrödinger operators on a graph
In this paper, we study some spectral properties of the discrete Schrodinger operator = Δ + q defined on a locally finite connected graph with an automorphism group whose orbit space is a finite
Spectral estimates for infinite quantum graphs
We investigate the bottom of the spectra of infinite quantum graphs, i.e., Laplace operators on metric graphs having infinitely many edges and vertices. We introduce a new definition of the
Analysis on graphs and noncommutative geometry
Abstract We study the form of the continuous time heat kernel for a second order discrete Laplacian on a weighted graph. The analysis is shown to be closely related to the theory of symmetric Markov
Dirichlet forms and stochastic completeness of graphs and subgraphs
Abstract We study Laplacians on graphs and networks via regular Dirichlet forms. We give a sufficient geometric condition for essential selfadjointness and explicitly determine the generators of the
Volume growth and spectrum for general graph Laplacians
We prove estimates relating exponential or sub-exponential volume growth of weighted graphs to the bottom of the essential spectrum for general graph Laplacians. The volume growth is computed with
On the Existence and Uniqueness of Self-Adjoint Realizations of Discrete (Magnetic) Schrödinger Operators
Discrete Laplacians and discrete magnetic Schrödinger operators feature in many different areas of mathematics. They are used in combinatorics and computer science, appear as discretizations of
Spectral Analysis on Graph-like Spaces
1 Introduction.- 2 Graphs and associated Laplacians.- 3 Scales of Hilbert space and boundary triples.- 4 Two operators in different Hilbert spaces.- 5 Manifolds, tubular neighbourhoods and their
Spectral graph theory
  • U. Feige
  • Mathematics
    Zeta and 𝐿-functions in Number Theory and Combinatorics
  • 2019
With every graph (or digraph) one can associate several different matrices. We have already seen the vertex-edge incidence matrix, the Laplacian and the adjacency matrix of a graph. Here we shall
...
1
2
3
4
5
...