Related papers: On the strong approximation and functional limit l…
We combine the method of exchangeable pairs with Stein's method for functional approximation. As a result, we give a general linearity condition under which an abstract Gaussian approximation theorem for stochastic processes holds. We apply…
In this paper, we present a linear-time approximation scheme for $k$-means clustering of \emph{incomplete} data points in $d$-dimensional Euclidean space. An \emph{incomplete} data point with $\Delta>0$ unspecified entries is represented as…
We prove a Poisson process approximation result for stabilizing functionals of a determinantal point process. Our results use concrete couplings of determinantal processes with different Palm measures and exploit their association…
The stochastic density functional theory (DFT) [Phys. Rev. Lett. 111, 106402 (2013)] is a valuable linear scaling approach to Kohn-Sham DFT that does not rely on the sparsity of the density matrix. Linear (and often sub-linear) scaling is…
The main purpose of this paper is to investigate the strong approximation of the $p$-fold integrated empirical process, $p$ being a fixed positive integer. More precisely, we obtain the exact rate of the approximations by a sequence of…
We study some asymptotic properties of cylinder processes in the plane defined as union sets of dilated straight lines (appearing as mutually overlapping infinitely long strips) derived from a stationary independently marked point process…
The perimeter and area generating functions of exactly solvable polygon models satisfy q-functional equations, where q is the area variable. The behaviour in the vicinity of the point where the perimeter generating function diverges can…
In this paper we propose a new iteration process, called the K iteration process, for approximation of fixed points. We show that our iteration process is faster than the existing leading iteration processes like Picard-S iteration process,…
This paper gives a simple proof of a limit theorem for the lenght of the largest interval straddling a fixed number of i.i.d. points uniformly disributed on a unit interval. The key step in our argument is a classical theorem of Watson…
In this master's thesis, we introduce expansion systems as a general framework to describe a large variety of approximation algorithms, such as Taylor approximation, decimal expansion and continued fraction. We consider some basic…
We study a natural geometric variant of the classic Knapsack problem called 2D-Knapsack: we are given a set of axis-parallel rectangles and a rectangular bounding box, and the goal is to pack as many of these rectangles inside the box…
Motivated by applications in redistricting, we consider the uniform capacitated k-median and uniform capacitated k-means problems in bounded doubling metrics. We provide the first QPTAS for both problems and the first PTAS for the uniform…
We prove a nonlinear regularity principle in sequence spaces which produces universal estimates for special series defined therein. Some consequences are obtained and, in particular, we establish new inclusion theorems for multiple summing…
In this work, we prove uniform continuity bounds for entropic quantities related to the sandwiched R\'enyi divergences such as the sandwiched R\'enyi conditional entropy. We follow three different approaches: The first one is the "almost…
Let $T \colon M \to M$ be a nonuniformly expanding dynamical system, such as logistic or intermittent map. Let $v \colon M \to \mathbb{R}^d$ be an observable and $v_n = \sum_{k=0}^{n-1} v \circ T^k$ denote the Birkhoff sums. Given a…
Large deviations for additive path functionals of stochastic processes have attracted significant research interest, in particular in the context of stochastic particle systems and statistical physics. Efficient numerical `cloning'…
The goal of this paper is to generalize the main results of [KM] and subsequent papers on metric Diophantine approximation with dependent quantities to the set-up of systems of linear forms. In particular, we establish `joint strong…
We study reinforcement learning methods with linear function approximation under non-Markov state and cost processes. We first consider the policy evaluation method and show that the algorithm converges under suitable ergodicity conditions…
We prove a uniform functional law of the logarithm for the local empirical process. To accomplish this we combine techniques from classical and abstract empirical process theory, Gaussian distributional approximation and probability on…
We consider a stationary Poisson process of $k$-planes in the $d$-dimensional hyperbolic space $\mathbb H^d$ of constant curvature $-1$, with $d \ge 4$ and $1 \le k \le d-1$. It is known that, after centring and normalization, the total…