相关论文: Approximating a sequence of observations by a simp…

We obtain an asymptotic H\"older estimate for functions satisfying a dynamic programming principle arising from a so-called ellipsoid process. By the ellipsoid process we mean a generalization of the random walk where the next step in the…

A determinantal point process is a stochastic point process that is commonly used to capture negative correlations. It has become increasingly popular in machine learning in recent years. Sampling a determinantal point process however…

In this paper we give a historical account of the development of Poisson approximation using Stein's method and present some of the main results. We give two recent applications, one on maximal arithmetic progressions and the other on…

We propose a new approach to sequential testing which is an adaptive (on-line) extension of the (off-line) framework developed in [10]. It relies upon testing of pairs of hypotheses in the case where each hypothesis states that the vector…

We consider the problem of recovering linear image of unknown signal belonging to a given convex compact signal set from noisy observation of another linear image of the signal. We develop a simple generic efficiently computable nonlinear…

We describe a framework in which is possible to develop and implement algorithms for the approximation of invariant measures of dynamical systems with a given bound on the error of the approximation. Our approach is based on a general…

This paper explores certain kinds of empirical process with respect to the components of multivariate Gaussian. We put forward some finite sample bounds which hold for multivariate Gaussian under general dependence. We give necessary and…

We consider the problem of reconstructing a function given its values on a set of points with finite density. We prove that with probability one, the values of an almost periodic function on a random array of points (with finite density)…

A peacock is a family of probability measures with finite mean that increases in convex order. It is a classical result, in the discrete time case due to Strassen, that any peacock is the family of one-dimensional marginals of a martingale.…

The problem of assigning probabilities when little is known is analized in the case where the quanities of interest are physical observables, i.e. can be measured and their values expressed by numbers. It is pointed out that the assignment…

The aim of the present work is to show that the results obtained earlier on the approximation of distributions of sums of independent summands by the accompanying compound Poisson laws and the estimates of the proximity of sequential…

For one-dimensional simple random walk in a general i.i.d. scenery and its limiting process we construct a coupling with explicit rate of approximation extending a recent result for Gaussian sceneries due to Khoshnevisan and Lewis.…

Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…

In pump-probe spectroscopy, one often needs to analyse the transmission or reflection of electromagnetic waves through optically pumped media. Here, it is common practice to approximate the analysis in order to extract non-equilibrium…

We construct explicit easily implementable polynomial approximations of sufficiently high accuracy for locally constant functions on the union of disjoint segments. This problem has important applications in several areas of numerical…

The likelihood for the parameters of a generalized linear mixed model involves an integral which may be of very high dimension. Because of this intractability, many approximations to the likelihood have been proposed, but all can fail when…

The standard series expansion for the period of a finite amplitude pendulum as a function of energy (and hence amplitude) provides a lower limit on the period when the series is truncated. An adjustment to the last term in the truncated…

We introduce the concept of matrix liberation process, a random matrix counterpart of the liberation process in free probability, and prove a large deviation upper bound for its empirical distribution with several properties on its rate…

This paper introduces some inverse sequences of different polyhedra all based on finite approximations of a compact metric space so they can be used to capture the shape type of the original space. It is shown that they are HPol-expansions,…

Let a continuous random process $X$ defined on $[0,1]$ be $(m+\beta)$-smooth, $0\le m, 0<\beta\le 1$, in quadratic mean for all $t>0$ and have an isolated singularity point at $t=0$. In addition, let $X$ be locally like a $m$-fold…