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 2α/(2α-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). 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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…