Related papers: A functional limit theorem for the profile of sear…

In the paper we consider the partial sum process $\sum_{k=1}^{[nt]}X_k^{(n)}$, where $\{X_k^{(n)}=\sum_{j=0}^{\infty} a_{j}^{(n)}\xi_{k-j}(b(n)), \ k\in \bz\},\ n\ge 1,$ is a series of linear processes with tapered filter…

Let $\{ X_{\bf n}, {\bf n}\in \mathbb{N}^d \}$ be a random field i.e. a family of random variables indexed by $\mathbb{N}^d $, $d\ge 2$. Complete convergence, convergence rates for non identically distributed, negatively dependent and…

In this paper, estimates for Kolmogorov, Gelfand and linear widths of function classes on sets with a tree-like structure are obtained. As examples we consider weighted Sobolev classes on a John domain, as well as some function classes on a…

An explicit bound is given for the Kolmogorov distance between a mixture of normal distributions and a normal distribution with properly chosen parameter values. A random variable X has a mixture of normal distributions if its conditional…

We establish effective convergence rates in the Doeblin-Lenstra law, describing the limiting distribution of approximation coefficients arising from continued fraction convergents of a typical real number. More generally, we prove…

Let $(X_i,i\geq 1)$ be a sequence of i.i.d. random variables with values in $[0,1]$, and $f$ be a function such that $`E(f(X_1)^2)<+\infty$. We show a functional central limit theorem for the process $t\mapsto \sum_{i=1}^n f(X_i)1_{X_i\leq…

In this paper we summarize some known facts on slice topology in the quaternionic case, and we deepen some of them by proving new results and discussing some examples. We then show, following [18], how this setting allows us to generalize…

Tree trace reconstruction aims to learn the binary node labels of a tree, given independent samples of the tree passed through an appropriately defined deletion channel. In recent work, Davies, R\'acz, and Rashtchian used combinatorial…

We study the problem of {\sl certification}: given queries to a function $f : \{0,1\}^n \to \{0,1\}$ with certificate complexity $\le k$ and an input $x^\star$, output a size-$k$ certificate for $f$'s value on $x^\star$. This abstractly…

Algorithmic meta-theorems, stating that graph properties expressible in some particular logic can be decided efficiently in graph classes having some specific structural properties, are now standard in sequential graph algorithms. One of…

Query-to-communication lifting theorems, which connect the query complexity of a Boolean function to the communication complexity of an associated `lifted' function obtained by composing the function with many copies of another function…

In this paper, we utilize the framework of Markov processes to attain a more probabilistic perspective on the theory of transfer operators. In doing so, we establish a functional central limit theorem (FLCT) for an $O(N)$ model associated…

In this article we derive a self-normalized functional limit theorem for strictly stationary linear processes with i.i.d. heavy-tailed innovations and random coefficients under the condition that all partial sums of the series of…

We study a decision tree model in which one is allowed to query subsets of variables. This model is a generalization of the standard decision tree model. For example, the $\lor-$decision (or $T_1$-decision) model has two queries, one is a…

We establish limit theorems that describe the asymptotic local and global geometric behaviour of random enriched trees considered up to symmetry. We apply these general results to random unlabelled weighted rooted graphs and uniform random…

The paper aims at finding widely and smoothly defined nonparametric location and scatter functionals. As a convenient vehicle, maximum likelihood estimation of the location vector m and scatter matrix S of an elliptically symmetric t…

We consider metrical task systems on tree metrics, and present an $O(\mathrm{depth} \times \log n)$-competitive randomized algorithm based on the mirror descent framework introduced in our prior work on the $k$-server problem. For the…

We prove a quantitative version of Hilbert's irreducibility theorem for function fields: If $f(T_1,\ldots, T_n,X)$ is an irreducible polynomial over the field of rational functions over a finite field $\mathbb{F}_q$ of characteristic $p$,…

Let M be a noncompact metric space in which every closed ball is compact, and let G be a semigroup of Lipschitz mappings of M. Denote by (Y_n)_{n\geq1} a sequence of independent G-valued, identically distributed random variables (r.v.'s),…

Monitoring random profiles over time is used to assess whether the system of interest, generating the profiles, is operating under desired conditions at any time-point. In practice, accurate detection of a change-point within a sequence of…