Related papers: Piterbarg's max-discretisation theorem for station…
We develop a theory to measure the variance and covariance of probability distributions defined on the nodes of a graph, which takes into account the distance between nodes. Our approach generalizes the usual (co)variance to the setting of…
We consider the persistence probability, the occupation-time distribution and the distribution of the number of zero crossings for discrete or (equivalently) discretely sampled Gaussian Stationary Processes (GSPs) of zero mean. We first…
We provide conditions that ensure that the recentered maximum of the Gaussian free field on a sequence of graphs fluctuates at the same order as the field at the point of maximal variance. In particular, on a sequence of such graphs the…
In a previous paper, the authors proved a conjecture of Lalley and Sellke that the empirical (time-averaged) distribution function of the maximum of branching Brownian motion converges almost surely to a Gumbel distribution. The result is…
In this work, we study the maximum matching problem from the perspective of sensitivity. The sensitivity of an algorithm $A$ on a graph $G$ is defined as the maximum Wasserstein distance between the output distributions of $A$ on $G$ and on…
Although distributed Gaussian process regression (GPR) enables multiple agents with separate datasets to jointly learn a model of the target function, its collaborative nature poses risks of private data leakage. To address this, we propose…
We study the probability distribution $F(u)$ of the maximum of smooth Gaussian fields defined on compact subsets of $\R^d$ having some geometric regularity. Our main result is a general formula for the density of $F$. Even though this is an…
In this paper we consider the distribution of the location of the path supremum in a fixed interval for self-similar processes with stationary increments. To this end, a point process is constructed and its relation to the distribution of…
We investigate graph based secret sharing schemes and its information ratio, also called complexity, measuring the maximal amount of information the vertices has to store. It was conjectured that in large girth graphs, where the interaction…
Multigrid methods have proven to be an invaluable tool to efficiently solve large sparse linear systems arising in the discretization of partial differential equations (PDEs). Algebraic multigrid methods and in particular adaptive algebraic…
The spread of a graph $G$ is the difference between the largest and smallest eigenvalues of the adjacency matrix of $G$. In this paper, we consider the family of graphs which contain no $K_{2,t}$-minor. We show that for any $t\geq 2$, there…
We study the stirring process with $N-1$ species on a generic graph $G=(V,\mathcal{E})$ with reservoirs. The multispecies stirring process generalizes the symmetric exclusion process, which is recovered in the case $N=2$. We prove the…
We give lower bounds for the density $p_T(x,y)$ of the law of $X_t$, the solution of $dX_t=\sigma (X_t) dB_t+b(X_t) dt,X_0=x,$ under the following local ellipticity hypothesis: there exists a deterministic differentiable curve $x_t, 0\leq…
Gaussian Processes and the Kullback-Leibler divergence have been deeply studied in Statistics and Machine Learning. This paper marries these two concepts and introduce the local Kullback-Leibler divergence to learn about intervals where two…
Given a finite set of points in $\mathbb{R}^d$, Tverberg's theorem guarantees the existence of partitions of this set into parts whose convex hulls intersect. We introduce a graph structured on the family of Tverberg partitions of a given…
The Pearcey process is a universal point process in random matrix theory and depends on a parameter $\rho \in \mathbb{R}$. Let $N(x)$ be the random variable that counts the number of points in this process that fall in the interval…
The probability distribution of the maximum $M_t$ of a single resetting Brownian motion (RBM) of duration $t$ and resetting rate $r$, properly centred and scaled, is known to converge to the standard Gumbel distribution of the classical…
In this paper we present the distribution of the maximum of the telegraph process in the cases where the initial velocity is positive or negative with an even and an odd number of velocity reversals. For the telegraph process with positive…
In this short note we will provide a sufficient and necessary condition to have uniqueness of the location of the maximum of a stochastic process over an interval. The result will also express the mean value of the location in terms of the…
We consider a stochastic directed graph on the integers whereby a directed edge between $i$ and a larger integer $j$ exists with probability $p_{j-i}$ depending solely on the distance between the two integers. Under broad conditions, we…