Graph limits of random graphs from a subset of connected k-trees

Abstract: For any set

O m e g a

of non-negative integers such that

0, 1 s u b s e t e q O m e g a

and

0, 1 e O m e g a

, we consider a random

O m e g a

-

k

-tree

{s f G}_{n, k}

that is uniformly selected from all connected

k

-trees of

(n + k)

vertices where the number of

(k + 1)

-cliques that contain any fixed

k

-clique belongs to

O m e g a

. We prove that

{s f G}_{n, k}

, scaled by

(k H_{k} s i g m a_{O m e g a}) / (2 s q r t n)

where

H_{k}

is the

k

-th Harmonic number and

s i g m a_{O m e g a} > 0

, converges to the Continuum Random Tree

m a t h c a l T_{s f e}

. Furthermore, we prove the local convergence of the rooted random

O m e g a

-

k

-tree

{s f G}_{n, k}^{c i r c}

to an infinite but locally finite random

O m e g a

-

k

-tree

{s f G}_{i n f t y, k}

.

Recommendations

Cites work

Cited in

(6)

This page was built for publication: Graph limits of random graphs from a subset of connected \(k\)-trees