相关论文: Singular Continuous and Dense Point Spectrum for S…

We present examples of rooted tree graphs for which the Laplacian has singular continuous spectral measures. For some of these examples we further establish fractional Hausdorff dimensions. The singular continuous components, in these…

We prove several results showing that absolutely continuous spectrum for the Laplacian on radial trees is a rare event. In particular, we show that metric trees with unbounded edges have purely singular spectrum and that generically (in the…

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…

In this paper we investigate the eigenvalue statistics of exponentially weighted ensembles of full binary trees and $p$-branching star graphs. We show that spectral densities of corresponding adjacency matrices demonstrate peculiar…

We present a simple yet rigorous approach to the determination of the spectral dimension of random trees, based on the study of the massless limit of the Gaussian model on such trees. As a byproduct, we obtain evidence in favor of a new…

A spectral faux tree with respect to a given matrix is a graph which is not a tree but is cospectral with a tree for the given matrix. We consider the existence of spectral faux trees for several matrices, with emphasis on constructions.…

We provide explicit upper bounds for the eigenvalues of the Laplacian on a finite metric tree subject to standard vertex conditions. The results include estimates depending on the average length of the edges or the diameter. In particular,…

We generalize the uniform spanning tree to construct a family of determinantal measures on essential spanning forests on periodic planar graphs in which every component tree is bi-infinite. Like the uniform spanning tree, these measures…

We obtain sharp lower and upper bounds for the number of maximal (under inclusion) independent sets in trees with fixed number of vertices and diameter. All extremal trees are described up to isomorphism.

We define generic ensembles of infinite trees. These are limits as $N\to\infty$ of ensembles of finite trees of fixed size $N$, defined in terms of a set of branching weights. Among these ensembles are those supported on trees with vertices…

Motivated by the work of Lov\'asz and Szegedy on the convergence and limits of dense graph sequences, we investigate the convergence and limits of finite trees with respect to sampling in normalized distance. Based on separable real trees,…

In this paper we study the adjacency spectrum of families of finite rooted trees with regular branching properties. In particular, we show that in the case of constant branching, the eigenvalues are realized as the roots of a family of…

We study the spectra of quantum trees of finite cone type. These are quantum graphs whose geometry has a certain homogeneity, and which carry a finite set of edge lengths, coupling constants and potentials on the edges. We show the spectrum…

In a variety of contexts, we prove that singular continuous spectrum is generic in the sense that for certain natural complete metric spaces of operators, those with singular spectrum are a dense $G_\delta$.

The Hausdorff dimension of spectral measure for the graph Laplacian is shown exactly in terms of an intermittency function. The intermittency function can be estimated by using one-dimensional discrete Schr\"{o}dinger operator method.

There are several common ways to encode a tree as a matrix, such as the adjacency matrix, the Laplacian matrix (that is, the infinitesimal generator of the natural random walk), and the matrix of pairwise distances between leaves. Such…

We consider the Laplacian on a rooted metric tree graph with branching number $ K \geq 2 $ and random edge lengths given by independent and identically distributed bounded variables. Our main result is the stability of the absolutely…

Trees of finite cone type have appeared in various contexts. In particular, they come up as simplified models of regular tessellations of the hyperbolic plane. The spectral theory of the associated Laplacians can thus be seen as induced by…

For a connected graph, the distance spectral radius is the largest eigenvalue of its distance matrix. In this paper, of all trees with both given order and fixed diameter, the trees with the minimal distance spectral radius are completely…

In this paper, we investigate the structures of an extremal tree which has the minimal number of subtrees in the set of all trees with the given degree sequence of a tree. In particular, the extremal trees must be caterpillar and but in…