Related papers: Exact bounds on epsilon processes
The $\epsilon$-substitution method is a technique for giving consistency proofs for theories of arithmetic. We use this technique to give a proof of the consistency of the impredicative theory $ID_1$ using a variant of the cut-elimination…
Recent advances in extreme value theory have established $\ell$-Pareto processes as the natural limits for extreme events defined in terms of exceedances of a risk functional. Here we provide methods for the practical modelling of data…
An inexact framework for high-order adaptive regularization methods is presented, in which approximations may be used for the $p$th-order tensor, based on lower-order derivatives. Between each recalculation of the $p$th-order derivative…
This paper derives new bounds on the difference of the entropies of two discrete random variables in terms of the local and total variation distances between their probability mass functions. The derivation of the bounds relies on maximal…
We consider the behavior of spatial point processes when subjected to a class of linear transformations indexed by a variable T. It was shown in Ellis [Adv. in Appl. Probab. 18 (1986) 646-659] that, under mild assumptions, the transformed…
An efficient approach to the calculation of the $\epsilon$-entropy is proposed. The method is based on the idea of looking at the information content of a string of data, by analyzing the signal only at the instants when the fluctuations…
In the regime of bounded transportation costs, additive approximations for the optimal transport problem are reduced (rather simply) to relative approximations for positive linear programs, resulting in faster additive approximation…
In studying the complexity of iterative processes it is usually assumed that the arithmetic operations of addition, multiplication, and division can be performed in certain constant times. This assumption is invalid if the precision…
We show how to underapproximate the procedure summaries of recursive programs over the integers using off-the-shelf analyzers for non-recursive programs. The novelty of our approach is that the non-recursive program we compute may capture…
The (Non-Preemptive) Throughput Maximization problem is a natural and fundamental scheduling problem. We are given $n$ jobs, where each job $j$ is characterized by a processing time and a time window, contained in a global interval $[0,T)$,…
This paper presents convergence acceleration, a method for computing efficiently the limit of numerical sequences as a typical application of streams and higher-order functions.
The paper deals with the expected maxima of continuous Gaussian processes $X = (X_t)_{t\ge 0}$ that are H\"older continuous in $L_2$-norm and/or satisfy the opposite inequality for the $L_2$-norms of their increments. Examples of such…
The decreasing enumeration of the points of a Poisson random measure whose mean measure has finite survival function on the positive half-axis can be represented as a non-increasing function of the jump times of a standard Poisson process.…
We present a new partial order reduction method for reachability analysis of nondeterministic labeled transition systems over metric spaces. Nondeterminism arises from both the choice of the initial state and the choice of actions, and the…
For processes involving structure functions and/or fragmentation functions, arguments that there is a part that dominates the NLO corrections are briefly reviewed. The arguments are tested against more recent NLO and in particular NNLO…
Linear differential equations and recurrences reveal many properties about their solutions. Therefore, these equations are well-suited for representing solutions and computing with special functions. We identify a large class of existing…
We propose the concept of adaptable processes as a way of overcoming the limitations that process calculi have for describing patterns of dynamic process evolution. Such patterns rely on direct ways of controlling the behavior and location…
We give a characterization of the invariant measures for the exclusion process on the integers with certain reversible transition kernels. Some examples include all nearest-neighbor kernels with asymptotic mean zero. One tool used is a…
In this work, new theoretical results on functional type a posteriori estimates for elliptic optimal control problems with control constraints are presented. More precisely, we derive new, sharp, guaranteed and fully computable lower bounds…
We obtain an almost sure bound for oscillation rates of empirical distribution functions for stationary causal processes. For short-range dependent processes, the oscillation rate is shown to be optimal in the sense that it is as sharp as…