AbstractA notion of band-limited functions is introduced in terms of a Hamiltonian on a quantum graph Γ. It is shown that a band-limited function is uniquely determined and can be reconstructed in a stable way from a countable set of “measurements” {Φi(f)}, i∈N, where {Φi} is a sequence of compactly supported measures whose supports are “small” and “densely” distributed over the graph. In particular, {Φi}, i∈N, can be a sequence of Dirac measures δxi, xi∈Γ. A reconstruction method in terms of frames is given which is a generalization of the classical result of Duffin–Schaeffer about exponential frames on intervals. The second reconstruction algorithm is based on an appropriate generalization of average variational splines to the case of qua...
We provide a quantum algorithm for the exact evaluation of the Potts partition function for a certai...
The article studies the exponential localization of eigenfunctions associated with isolated eigenva...
Abstract: Let G be a metric, finite, noncompact, and connected graph with finitely many edges and ve...
AbstractA notion of band-limited functions is introduced in terms of a Hamiltonian on a quantum grap...
AbstractA notion of splines is introduced on a quantum graph Γ. It is shown that eigen values of a H...
In the present theses we study spectral and resonance properties of quantum graphs. First, we consid...
We introduce the notion of Benjamini-Schramm convergence for quantum graphs. This notion of converge...
We study how far it is possible to reconstruct a graph from various Banach algebras associated to it...
This thesis consists of four papers and deals with the spectral theory of quantum graphs. A quantum ...
We investigate the properties of the zeros of the eigenfunctions on quantum graphs (metric graphs wi...
We investigate quantum graphs with infinitely many vertices and edges without the common restriction...
A quantum graph is a weighted combinatorial graph equipped with a Hamiltonian operator acting on fun...
In this paper we study the problem of unique reconstruction of the quantum graphs. The idea is based...
We present a recursive prescription to calculate the exact Green function for general quantum graphs...
Presented at the QMath13 Conference: Mathematical Results in Quantum Theory, October 8-11, 2016 at t...
We provide a quantum algorithm for the exact evaluation of the Potts partition function for a certai...
The article studies the exponential localization of eigenfunctions associated with isolated eigenva...
Abstract: Let G be a metric, finite, noncompact, and connected graph with finitely many edges and ve...
AbstractA notion of band-limited functions is introduced in terms of a Hamiltonian on a quantum grap...
AbstractA notion of splines is introduced on a quantum graph Γ. It is shown that eigen values of a H...
In the present theses we study spectral and resonance properties of quantum graphs. First, we consid...
We introduce the notion of Benjamini-Schramm convergence for quantum graphs. This notion of converge...
We study how far it is possible to reconstruct a graph from various Banach algebras associated to it...
This thesis consists of four papers and deals with the spectral theory of quantum graphs. A quantum ...
We investigate the properties of the zeros of the eigenfunctions on quantum graphs (metric graphs wi...
We investigate quantum graphs with infinitely many vertices and edges without the common restriction...
A quantum graph is a weighted combinatorial graph equipped with a Hamiltonian operator acting on fun...
In this paper we study the problem of unique reconstruction of the quantum graphs. The idea is based...
We present a recursive prescription to calculate the exact Green function for general quantum graphs...
Presented at the QMath13 Conference: Mathematical Results in Quantum Theory, October 8-11, 2016 at t...
We provide a quantum algorithm for the exact evaluation of the Potts partition function for a certai...
The article studies the exponential localization of eigenfunctions associated with isolated eigenva...
Abstract: Let G be a metric, finite, noncompact, and connected graph with finitely many edges and ve...