Papers
Topics
Authors
Recent
Search
2000 character limit reached

Random walks on decorated Galton-Watson trees

Published 14 Nov 2020 in math.PR | (2011.07266v2)

Abstract: In this article, we study a simple random walk on a decorated Galton-Watson tree, obtained from a Galton-Watson tree by replacing each vertex of degree $n$ with an independent copy of a graph $G_n$ and gluing the inserted graphs along the tree structure. We assume that there exist constants $d, R \geq 1, v < \infty$ such that the diameter, effective resistance across and volume of $G_n$ respectively grow like $n{\frac{1}{d}}, n{\frac{1}{R}}, nv$ as $n \to \infty$. We also assume that the underlying Galton-Watson tree is critical with offspring tails decaying like $cx{-\alpha}$ for some constant $c>0$ and some $\alpha \in (1,2)$. We establish the fractal dimension, spectral dimension, walk dimension and simple random walk displacement exponent for the resulting metric space as functions of $\alpha, d, R$ and $v$, along with bounds on the fluctuations of these quantities.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.