Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. On the spectral dime ...
Conference paper

On the spectral dimension of random trees

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
Download article
Open on HAL
Imported on
May 10, 2017
Published on
December 31, 2005
Last modified on
March 31, 2025
Volume 0
DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities
Proceedings
DOI
10.46298/dmtcs.3507
License
https://about.hal.science/hal-authorisation-v1
Indicators
570
Views
473
Downloads

On the spectral dimension of random trees

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
Abstract
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 $\textit{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 $\textit{generic random trees}$, which are obtained as limits of ensembles of finite trees conditioned to have fixed size $N$, as $N \to \infty$. Among these ensembles is the so-called uniform random tree. We show that generic random trees have spectral dimension $d_s=4/3$.
Keywords
  • [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]
  • spectral dimension
  • random combs
  • random trees
Cited by

Source: OpenCitations

  • On the Spectral Dimension of Causal Triangulations

    arXiv (Cornell University)

    Authors : Bergfinnur Durhuus ORCID, Thordur Jonsson ORCID, John F. Wheater ORCID

    Journal reference : Volume 139, 2010, pp. 859-881

    DOI : 10.1007/s10955-010-9968-x
Preview
Loading PDF preview...