Papers
Topics
Authors
Recent
2000 character limit reached

Boundedness of Gaussian random sums on trees (2107.04177v1)

Published 9 Jul 2021 in math.PR

Abstract: Let $\mathcal{T}$ be a rooted tree endowed with the natural partial order $\preceq$. Let $(Z(v)){v\in \mathcal{T}}$ be a sequence of independent standard Gaussian random variables and let $\alpha = (\alpha_k){k=1}\infty$ be a sequence of real numbers with $\sum_{k=1}\infty \alpha_k2<\infty$. Set $\alpha_0 =0$ and define a Gaussian process on $\mathcal{T}$ in the following way: [ G(\mathcal{T}, \alpha; v): = \sum_{u\preceq v} \alpha_{|u|} Z(u), \quad v \in \mathcal{T}, ] where $|u|$ denotes the graph distance between the vertex $u$ and the root vertex. Under mild assumptions on $\mathcal{T}$, we obtain a necessary and sufficient condition for the almost sure boundedness of the above Gaussian process. Our condition is also necessary and sufficient for the almost sure uniform convergence of the Gaussian process $G(\mathcal{T}, \alpha; v)$ along all rooted geodesic rays in $\mathcal{T}$.

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Paper to Video (Beta)

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.

Collections

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