Boundedness of Gaussian random sums on trees

arxiv(2021)

引用 0|浏览0
暂无评分
摘要
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_k^2<\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}$.
更多
查看译文
关键词
random sums,trees
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要