Spectral asymptotics for stable trees
Abstract
We calculate the mean and almost-sure leading order behaviour of the high frequency asymptotics of the eigenvalue counting function associated with the natural Dirichlet form on -stable trees, which lead in turn to short-time heat kernel asymptotics for these random structures. In particular, the conclusions we obtain demonstrate that the spectral dimension of an -stable tree is almost-surely equal to , matching that of certain related discrete models. We also show that the exponent for the second term in the asymptotic expansion of the eigenvalue counting function is no greater than . To prove our results, we adapt a self-similar fractal argument previously applied to the continuum random tree, replacing the decomposition of the continuum tree at the branch point of three suitably chosen vertices with a recently developed spinal decomposition for -stable trees.
Cite
@article{arxiv.1006.1570,
title = {Spectral asymptotics for stable trees},
author = {David Croydon and Ben Hambly},
journal= {arXiv preprint arXiv:1006.1570},
year = {2010}
}
Comments
29 pages