English
Related papers

Related papers: Boundedness of Gaussian random sums on trees

200 papers

Gaussian fields $(g_x)$ on $\mathbb{Z}_q^d$ are constructed from a class of reversible long range random walks $(X_t)_{t\in \mathbb{N}}$ on $\mathbb{Z}_q^d$ in arXiv:2510.22554. The construction is from taking the covariance function of…

Probability · Mathematics 2026-02-24 Robert Griffiths , Shuhei Mano

We propose a principled way to define Gaussian process priors on various sets of unweighted graphs: directed or undirected, with or without loops. We endow each of these sets with a geometric structure, inducing the notions of closeness and…

Machine Learning · Statistics 2023-02-28 Viacheslav Borovitskiy , Mohammad Reza Karimi , Vignesh Ram Somnath , Andreas Krause

We consider the random conductance model, where the underlying graph is an infinite supercritical Galton--Watson tree, the conductances are independent but their distribution may depend on the degree of the incident vertices. We prove that,…

Probability · Mathematics 2015-03-17 Nina Gantert , Sebastian Müller , Serguei Popov , Marina Vachkovskaia

Under K.-T. Sturm's formulation, we obtain a Gaussian upper bound for tail probability of mean value of independent, identically distributed random variables with values in $\mathbb{R}$-trees and Hadamard manifolds.

Probability · Mathematics 2009-06-04 Kei Funano

For a finite simple undirected graph $G$, let $\gamma(G)$ denote the size of a smallest dominating set of $G$ and $\mu(G)$ denote the number of eigenvalues of the Laplacian matrix of $G$ in the interval $[0,1)$, counting multiplicities.…

Spectral Theory · Mathematics 2025-11-11 Deepak Rajendraprasad , Durga R. Sankaranarayanan

In this paper, we study the random walk on a supercritical branching process with an uncountable and unbounded set of types supported on the $d$-regular tree $\mathbb{T}_d$ ($d\geq 3$), namely the cluster $\mathcal{C}_\circ^h$ of the root…

Probability · Mathematics 2023-04-19 Guillaume Conchon--Kerjan

Let $G$ be a connected graph with vertex set $V(G)$, and denote by $d_G(u,v)$ the distance from $u$ to $v$ in $G$, for any $u,v \in V(G)$. The average distance of an $n$-vertex connected graph $G$, denoted by $\mu(G)$, is defined to be the…

Combinatorics · Mathematics 2026-05-07 Zhibin Du , Xuli Qi

In this article, we prove an extreme value theorem on the limit distribution of geodesics in a geometrically finite quotient of $\Gamma\backslash\mathcal{T}$ a locally finite tree. Main examples of such graphs are quotients of a Bruhat-Tits…

Dynamical Systems · Mathematics 2019-01-29 Sanghoon Kwon , Seonhee Lim

Under certain mild conditions, limit theorems for additive functionals of some $d$-dimensional self-similar Gaussian processes are obtained. These limit theorems work for general Gaussian processes including fractional Brownian motions,…

Probability · Mathematics 2023-05-23 Minhao Hong , Heguang Liu , Fangjun Xu

This paper develops a new direct approach to approximating suprema of general empirical processes by a sequence of suprema of Gaussian processes, without taking the route of approximating whole empirical processes in the sup-norm. We prove…

Probability · Mathematics 2014-08-19 Victor Chernozhukov , Denis Chetverikov , Kengo Kato

We consider a branching random walk on a $d$-ary tree of height $n$ ($n \in \mathbb{N}$), under the presence of a hard wall which restricts each value to be positive, where $d$ is a natural number satisfying $d\geqslant2$. The question of…

Probability · Mathematics 2024-02-23 Rishideep Roy

We consider versions of the FIND algorithm where the pivot element used is the median of a subset chosen uniformly at random from the data. For the median selection we assume that subsamples of size asymptotic to $c \cdot n^\alpha$ are…

Probability · Mathematics 2013-11-20 Henning Sulzbach , Ralph Neininger , Michael Drmota

We consider a sequence $\mathbf{T} = (\mathcal{T}_n : n \in \mathbb{N}^+)$ of trees $\mathcal{T}_n$ where, for some $\Delta \in \mathbb{N}^+$ every $\mathcal{T}_n$ has height at most $\Delta$ and as $n \to \infty$ the minimal number of…

Logic in Computer Science · Computer Science 2025-04-08 Vera Koponen , Yasmin Tousinejad

For a given homogeneous Poisson point process in $\mathbb{R}^d$ two points are connected by an edge if their distance is bounded by a prescribed distance parameter. The behaviour of the resulting random graph, the Gilbert graph or random…

Probability · Mathematics 2017-11-06 Matthias Reitzner , Matthias Schulte , Christoph Thaele

Gaussian process is one of the most popular non-parametric Bayesian methodologies for modeling the regression problem. It is completely determined by its mean and covariance functions. And its linear property makes it relatively…

Machine Learning · Statistics 2020-06-16 Wenqi Fang , Huiyun Li , Hui Huang , Shaobo Dang , Zhejun Huang , Zheng Wang

Let $P$ be a linear differential operator over $\mathcal{D} \subset \mathbb{R}^d$ and $U = (U_x)_{x \in \mathcal{D}}$ a second order stochastic process. In the first part of this article, we prove a new necessary and sufficient condition…

Statistics Theory · Mathematics 2022-02-11 Iain Henderson , Pascal Noble , Olivier Roustant

Sparse variational Gaussian processes (GPs) construct tractable posterior approximations to GP models. At the core of these methods is the assumption that the true posterior distribution over training function values ${\bf f}$ and inducing…

Machine Learning · Computer Science 2025-06-27 Michalis K. Titsias

We consider Gibbs distributions on finite random plane trees with bounded branching. We show that as the order of the tree grows to infinity, the distribution of any finite neighborhood of the root of the tree converges to a limit. We…

Probability · Mathematics 2010-03-04 Yuri Bakhtin

We derive, up to a constant factor, matching lower and upper bounds on the concentration functions of suprema of separable centered Gaussian processes and order statistics of Gaussian random fields. These bounds reveal that suprema of…

Probability · Mathematics 2023-10-19 Alexander Giessing

We prove that the local limit of the weighted spanning trees on any simple connected high degree almost regular sequence of electric networks is the Poisson(1) branching process conditioned to survive forever, by generalizing [NP22] and…

Probability · Mathematics 2026-01-01 Ágnes Kúsz