Related Experiment Video
Updated: Sep 2, 2025

05:39
Scalable Quantum Integrated Circuits on Superconducting Two-Dimensional Electron Gas Platform
Published on: August 2, 2019
9.7K
Self-adjoint and Markovian extensions of infinite quantum graphs
Aleksey Kostenko1,2,3, Delio Mugnolo4, Noema Nicolussi3
1Faculty of Mathematics and Physics University of Ljubljana Ljubljana Slovenia.
Summary
We introduce "finite volume" graph ends, a new boundary concept for infinite metric graphs. This concept clarifies the uniqueness of Markovian extensions for the Kirchhoff Laplacian.
Area of Science:
- Graph theory
- Spectral graph theory
- Geometric analysis
Background:
- The study of boundaries for infinite graphs is crucial in various mathematical fields.
- Self-adjoint extensions of differential operators are fundamental in quantum mechanics and spectral theory.
- The Kirchhoff Laplacian on metric graphs is a key operator for analyzing graph properties.
Purpose of the Study:
- To establish a connection between graph ends and self-adjoint extensions of the Kirchhoff Laplacian on metric graphs.
- To introduce and define the concept of finite volume for graph ends.
- To characterize the boundary properties of metric graphs relevant to Markovian extensions.
Main Methods:
- Investigation of the relationship between graph ends and self-adjoint extensions.
- Introduction of the "finite volume" property for graph ends.
- Analysis of Markovian extensions of the Kirchhoff Laplacian.
- Development of traces for functions and normal derivatives on graph ends.
Main Results:
- Finite volume graph ends are identified as the appropriate boundary notion for Markovian extensions of the Kirchhoff Laplacian.
- A transparent geometric characterization for the uniqueness of Markovian extensions and the self-adjointness of the Gaffney Laplacian is provided.
- For graphs with finitely many finite volume ends, a complete description of Markovian extensions is developed.
Conclusions:
- The concept of finite volume ends offers a novel geometric perspective on boundary conditions for infinite graphs.
- This work bridges concepts from graph theory and spectral theory, providing tools for analyzing complex graph structures.
- The findings have implications for understanding operators on graphs, particularly in contexts involving infinite or unbounded structures.
Related Concept Videos
The Quantum-Mechanical Model of an Atom
43.0K
Shortly after de Broglie published his ideas that the electron in a hydrogen atom could be better thought of as being a circular standing wave instead of a particle moving in quantized circular orbits, Erwin Schrödinger extended de Broglie’s work by deriving what is now known as the Schrödinger equation. When Schrödinger applied his equation to hydrogen-like atoms, he was able to reproduce Bohr’s expression for the energy and, thus, the Rydberg formula governing hydrogen spectra.
43.0K
Vector Algebra: Graphical Method
13.1K
Vectors can be multiplied by scalars, added to other vectors, or subtracted from other vectors. The vector sum of two (or more) vectors is called the resultant vector or, for short, the resultant.
We use the laws of geometry to construct resultant vectors, followed by trigonometry to find vector magnitudes and directions. For a geometric construction of the sum of two vectors in a plane, we follow the parallelogram rule. Suppose two vectors are at arbitrary positions. Translate either one of...
We use the laws of geometry to construct resultant vectors, followed by trigonometry to find vector magnitudes and directions. For a geometric construction of the sum of two vectors in a plane, we follow the parallelogram rule. Suppose two vectors are at arbitrary positions. Translate either one of...
13.1K
Hückel's Rule Diagram of π MOs: Frost Circle
4.6K
The Frost circle or the inscribed polygon method is a graphical method for determining the relative energies of π molecular orbitals (MOs) for planar, fully conjugated, and monocyclic compounds. This method was first described by A. A. Frost and Boris Musulin in 1953.
A Frost circle is constructed by drawing a polygon whose number of edges is equal to the number of carbons of the given cyclic system, with one of the vertices pointing down. Then, a circle is drawn enclosing the polygon so...
A Frost circle is constructed by drawing a polygon whose number of edges is equal to the number of carbons of the given cyclic system, with one of the vertices pointing down. Then, a circle is drawn enclosing the polygon so...
4.6K
Bewley Lattice Diagram
829
The Bewley lattice diagram, developed by L. V. Bewley, effectively organizes the reflections occurring during transmission-line transients. It visually represents how voltage waves propagate and reflect within a transmission line, making it easier to understand the complex interactions that occur.
829
Molecular Orbital Theory I
32.6K
Overview of Molecular Orbital Theory
32.6K
Graphing the Wave Function
2.1K
Consider the wave equation for a sinusoidal wave moving in the positive x-direction. The wave equation is a function of both position and time. From the wave equation, two different graphs can be plotted.
2.1K

