English
Related papers

Related papers: Resonances on regular tree graphs

200 papers

We consider open manifolds which are interiors of a compact manifold with boundary, and Riemannian metrics asymptotic to a conformally cylindrical metric near the boundary. We show that the essential spectrum of the Laplace operator on…

Differential Geometry · Mathematics 2007-05-23 Sylvain Golénia , Sergiu Moroianu

We analyse the spectral phase diagram of Schr\"odinger operators $ T +\lambda V$ on regular tree graphs, with $T$ the graph adjacency operator and $V$ a random potential given by iid random variables. The main result is a criterion for the…

Mathematical Physics · Physics 2013-07-09 Michael Aizenman , Simone Warzel

The Laplace-Beltrami operator on cusp manifolds has continuous spectrum. The resonances are complex numbers that replace the discrete spectrum of the compact case. They are the poles of a meromorphic function $\varphi(s)$, $s\in…

Spectral Theory · Mathematics 2018-10-18 Yannick Bonthonneau

We investigate spectral properties of Kirchhoff Laplacians on radially symmetric antitrees. This class of metric graphs enjoys a rich group of symmetries, which enables us to obtain a decomposition of the corresponding Laplacian into the…

Spectral Theory · Mathematics 2021-09-07 Aleksey Kostenko , Noema Nicolussi

We show how the spectrum of a graph Laplacian changes with respect to a certain type of rank-one perturbation. We apply our finding to give new short proofs of the spectral version of Kirchhoff's Matrix Tree Theorem and known derivations…

Combinatorics · Mathematics 2020-08-05 Steven Klee , Matthew T. Stamps

We study the spectrum of random operators on a large class of trees. These trees have finitely many cone types and they can be constructed by a substitution rule. The random operators are perturbations of Laplace type operators either by…

Mathematical Physics · Physics 2011-08-02 Matthias Keller , Daniel Lenz , Simone Warzel

Determining and analyzing the spectra of graphs is an important and exciting research topic in theoretical computer science. The eigenvalues of the normalized Laplacian of a graph provide information on its structural properties and also on…

Combinatorics · Mathematics 2016-05-20 Pinchen Xie , Zhongzhi Zhang , Francesc Comellas

Kirchhoff showed that the number of spanning trees of a graph is the spectral determinant of the combinatorial Laplacian divided by the number of vertices; we reframe this result in the quantum graph setting. We prove that the spectral…

Spectral Theory · Mathematics 2023-03-29 Jonathan Harrison , Tracy Weyand

We study basic spectral features of graph Laplacians associated with a class of rooted trees which contains all regular trees. Trees in this class can be generated by substitution processes. Their spectra are shown to be purely absolutely…

Spectral Theory · Mathematics 2011-01-11 Matthias Keller , Daniel Lenz , Simone Warzel

We study spectral asymptotics for the Laplace operator on differential forms on a Riemannian foliated manifold equipped with a bundle-like metric in the case when the metric is blown up in directions normal to the leaves of the foliation.…

dg-ga · Mathematics 2008-02-03 Yuri A. Kordyukov

We consider a family of compact manifolds which shrinks with respect to an appropriate parameter to a graph. The main result is that the spectrum of the Laplace-Beltrami operator converges to the spectrum of the (differential) Laplacian on…

Mathematical Physics · Physics 2020-01-30 Pavel Exner , Olaf Post

Working with tree graphs is always easier than with loopy ones and spanning trees are the closest tree-like structures to a given graph. We find a correspondence between the solutions of random K-satisfiability problem and those of spanning…

Disordered Systems and Neural Networks · Physics 2009-11-11 A. Ramezanpour , S. Moghimi-Araghi

We study a class of rooted trees with a substitution type structure. These trees are not necessarily regular, but exhibit a lot of symmetries. We consider nearest neighbor operators which reflect the symmetries of the trees. The spectrum of…

Spectral Theory · Mathematics 2015-03-17 Matthias Keller

We study the $p$-independence of spectra of Laplace operators on graphs arising from regular Dirichlet forms on discrete spaces. Here, a sufficient criterion is given solely by a uniform subexponential growth condition. Moreover, under a…

Spectral Theory · Mathematics 2012-11-29 Frank Bauer , Bobo Hua , Matthias Keller

We investigate analytically and numerically eigenfunction statistics in a disordered system on a finite Bethe lattice (Cayley tree). We show that the wave function amplitude at the root of a tree is distributed fractally in a large part of…

Disordered Systems and Neural Networks · Physics 2016-12-28 K. S. Tikhonov , A. D. Mirlin

We give some graph theoretical formulas for the trace $Tr_k(\mathbb {T})$ of a tensor $\mathbb {T}$ which do not involve the differential operators and auxiliary matrix. As applications of these trace formulas in the study of the spectra of…

Spectral Theory · Mathematics 2013-07-23 Jia-Yu Shao , Liqun Qi , Shenglong Hu

We consider a non self-adjoint Laplacian on a directed graph with non symmetric edge weights. We analyse spectral properties of this Laplacian under a Kirchhoff assumption. Moreover we establish isoperimet-ric inequalities in terms of the…

Spectral Theory · Mathematics 2018-01-15 Marwa Balti

We study the minimum spanning tree distribution on the space of spanning trees of the $n$-by-$n$ grid for large $n$. We establish bounds on the decay rates of the probability of the most and the least probable spanning trees as…

Probability · Mathematics 2025-12-18 Kristopher Tapp

Let $T$ be a tree. A vertex of degree one is a \emph{leaf} of $T$ and a vertex of degree at least three is a \emph{branch vertex} of $T$. A graph is said to be \emph{$K_{1,4}$-free} if it does not contain $K_{1,4}$ as an induced subgraph.…

Combinatorics · Mathematics 2022-01-05 Pham Hoang Ha

In this paper, we study some spanning trees with bounded degree and leaf degree from eigenvalues. For any integer $k\geq2$, a $k$-tree is a spanning tree in which every vertex has degree no more than $k$. Let $T$ be a spanning tree of a…

Combinatorics · Mathematics 2024-07-29 Chang Liu , Jianping Li
‹ Prev 1 2 3 10 Next ›