Loading [MathJax]/jax/output/HTML-CSS/jax.js

Bergfinnur Durhuus ; Thordur Jonsson ; John Wheater - On the spectral dimension of random trees

dmtcs:3507 - Discrete Mathematics & Theoretical Computer Science, January 1, 2006, DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities - https://doi.org/10.46298/dmtcs.3507
On the spectral dimension of random treesConference paper

Authors: Bergfinnur Durhuus 1; Thordur Jonsson 2; John Wheater 3,4

  • 1 Department of Mathematical Sciences [Copenhagen]
  • 2 Science Institute
  • 3 Rudolf Peierls Center for Theoretical Physics
  • 4 Rudolf Peierls Centre for Theoretical Physics

We determine the spectral dimensions of a variety of ensembles of infinite trees. Common to the ensembles considered is that sample trees have a distinguished infinite spine at whose vertices branches can be attached according to some probability distribution. In particular, we consider a family of ensembles of combs, whose branches are linear chains, with spectral dimensions varying continuously between 1 and 3/2. We also introduce a class of ensembles of infinite trees, called generic random trees, which are obtained as limits of ensembles of finite trees conditioned to have fixed size N, as N. Among these ensembles is the so-called uniform random tree. We show that generic random trees have spectral dimension ds=4/3.


Volume: DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities
Section: Proceedings
Published on: January 1, 2006
Imported on: May 10, 2017
Keywords: spectral dimension,random combs,random trees,[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS],[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]

1 Document citing this article

Consultation statistics

This page has been seen 275 times.
This article's PDF has been downloaded 238 times.