Random enriched trees with applications to random graphs (Q1658748)

From MaRDI portal





scientific article
Language Label Description Also known as
default for all languages
No label defined
    English
    Random enriched trees with applications to random graphs
    scientific article

      Statements

      Random enriched trees with applications to random graphs (English)
      0 references
      0 references
      15 August 2018
      0 references
      Summary: We establish limit theorems that describe the asymptotic local and global geometric behaviour of random enriched trees considered up to symmetry. We apply these general results to random unlabelled weighted rooted graphs and uniform random unlabelled \(k\)-trees that are rooted at a \(k\)-clique of distinguishable vertices. For both models we establish a Gromov-Hausdorff scaling limit, a Benjamini-Schramm limit, and a local weak limit that describes the asymptotic shape near the fixed root.
      0 references
      random graphs
      0 references
      symmetries
      0 references
      scaling limits
      0 references
      local weak limits
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers