English

Spectral asymptotics for stable trees

Probability 2010-06-09 v1

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 α\alpha-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 α\alpha-stable tree is almost-surely equal to 2α/(2α1)2\alpha/(2\alpha-1), 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 1/(2α1)1/(2\alpha-1). 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 α\alpha-stable trees.

Keywords

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

R2 v1 2026-06-21T15:33:27.300Z