Related papers: Random Gaussian sums on trees

Gaussian processes retain the linear model either as a special case, or in the limit. We show how this relationship can be exploited when the data are at least partially linear. However from the perspective of the Bayesian posterior, the…

Many popular Bayesian nonparametric priors can be characterized in terms of exchangeable species sampling sequences. However, in some applications, exchangeability may not be appropriate. We introduce a {novel and probabilistically coherent…

This paper considers extreme values attained by a centered, multidimensional Gaussian process $X(t)= (X_1(t),\ldots,X_n(t))$ minus drift $d(t)=(d_1(t),\ldots,d_n(t))$, on an arbitrary set $T$. Under mild regularity conditions, we establish…

Suppose $(X_t)_{t \in T}$ is a Gaussian process indexed by some arbitrary set $T:$ the random variable $\sup_{t \in T}{X_t}$ can be very intricate and bounding its expectation is a natural step towards understanding it. Sudakov-Fernique…

In this article we introduce and study oscillating Gaussian processes defined by $X_t = \alpha_+ Y_t {\bf 1}_{Y_t >0} + \alpha_- Y_t{\bf 1}_{Y_t<0}$, where $\alpha_+,\alpha_->0$ are free parameters and $Y$ is either stationary or…

In this work, we derive sharp non-asymptotic deviation bounds for weighted sums of Dirichlet random variables. These bounds are based on a novel integral representation of the density of a weighted Dirichlet sum. This representation allows…

We consider the self-normalized sums $T_{n}=\sum_{i=1}^{n}X_{i}Y_{i}/\sum_{i=1}^{n}Y_{i}$, where ${Y_{i} : i\geq 1}$ are non-negative i.i.d. random variables, and ${X_{i} : i\geq 1} $ are i.i.d. random variables, independent of ${Y_{i} : i…

We consider fixed-point equations for probability measures charging measured compact metric spaces that naturally yield continuum random trees. On the one hand, we study the existence/uniqueness of the fixed-points and the convergence of…

Given a simple, unweighted, undirected graph $G=(V,E)$ with $|V|=n$ and $|E|=m$, and parameters $0 < \varepsilon, \delta <1$, along with \texttt{Degree}, \texttt{Neighbour}, \texttt{Edge} and \texttt{RandomEdge} query access to $G$, we…

The notion of tree entropy was introduced by the author as a normalized limit of the number of spanning trees in finite graphs, but is defined on random infinite rooted graphs. We give some new expressions for tree entropy; one uses…

We analyse a trimmed stochastic process of the form ${}^{(r)}X_t= X_t - \sum_{i=1}^r \Delta_t^{(i)}$, where $(X_t)_{t \geq 0}$ is a driftless subordinator on $\mathbb{R}$ with its jumps on $[0,t]$ ordered as $ \Delta_t^{(1)}\ge…

We introduce the notion of a restricted exchangeable partition of $\mathbb{N}$. We obtain integral representations, consider associated fragmentations, embeddings into continuum random trees and convergence to such limit trees. In…

In this paper, we provide finite sample results to assess the consistency of Generalized Pareto regression trees, as tools to perform extreme value regression. The results that we provide are obtained from concentration inequalities, and…

We study fragmentation of a random recursive tree into a forest by repeated removal of nodes. The initial tree consists of N nodes and it is generated by sequential addition of nodes with each new node attaching to a randomly-selected…

Let $G$ be a connected edge-weighted graph of order $n$ and size $m$. Let $w:E(G)\rightarrow \mathbb{R}^{\geq 0}$ be the weighting function. We assume that $w$ is normalised, that is, $\sum_{e\in E(G)} w(e)=m$. The weighted distance…

A random forest prediction can be computed by the scalar product of the labels of the training examples and a set of weights that are determined by the leafs of the forest into which the test object falls; each prediction can hence be…

Let ${\cal T}$ be a rooted Galton-Watson tree with offspring distribution $\{p_k\}$ that has $p_0=0$, mean $m=\sum kp_k>1$ and exponential tails. Consider the $\lambda$-biased random walk $\{X_n\}_{n\geq 0}$ on ${\cal T}$; this is the…

Building on previous work of [BPS] we investigate $\sigma$-closed partial orders of size continuum. We provide both an internal and external characterization of such partial orders by showing that (1) every $\sigma$-closed partial order of…

In this paper, we study weights for the Thresholding Greedy Algorithm (TGA). While previous work focused on sequential weights $\varsigma = (s_n)_{n\in\mathbb{N}}$ on each positive integer, we study a more general weight $\omega =…

The eccentricity of a vertex $v$ in a graph $G$ is the maximum distance from $v$ to any other vertex. The vertices whose eccentricity are equal to the diameter (the maximum eccentricity) of $G$ are called peripheral vertices. In trees the…