We consider the asymptotic almost sure behavior of the solution of the equation u(t, x) = u0(x) + κ ∫ t

We study the almost sure convergence of the Bartlett estimator for the asymptotic variance of the sample mean of a stationary weekly dependent process. We also study the a. s. behavior of this estimator in the case of long-range dependent observations. In the weakly dependent case, we establish conditions under which the estimator is strongly consistent. We also show that, after appropriate nor...

Two-dimensional (2-D) and, more generally, multidimensional harmonic retrieval is of interest in a variety of applications, including transmitter localization and joint time and frequency offset estimation in wireless communications. The associated identifiability problem is key in understanding the fundamental limitations of parametric methods in terms of the number of harmonics that can be re...

I would like to tell you about an easily stated problem which lies at the border of geometry, probability and classical analysis. In the summer of 2005 two undergraduates at McGill University worked in this general area, and were able to make some progress. When posing the project to them I made a certain conjecture, and (as expected) they did not get far enough in their eight week project to b...

We consider a financial model with permanent price impact. Continuous time trading dynamics are derived as the limit of discrete rebalancing policies. We then study the problem of super-hedging a European option. Our main result is the derivation of a quasi-linear pricing equation. It holds in the sense of viscosity solutions. When it admits a smooth solution, it provides a perfect hedging stra...

This paper considers the computational hardness of computing expected outcomes and deciding (universal) (positive) almost–sure termination of probabilistic programs. It is shown that computing lower and upper bounds of expected outcomes is Σ 1– and Σ 0 2–complete, respectively. Deciding (universal) almost–sure termination as well as deciding whether the expected outcome of a program equals a gi...

We consider the asymptotic almost sure behavior of the solution of the equation u(t, x) = u0(x) + κ ∫ t

We relax the moment conditions from a result in almost sure limit theory for U-statistics due to Berkes and Csaki (2001). We extend this result to the case of convergence to stable laws and also prove a functional version.

Let a class F of densities be given. We draw an i.i.d. sample from a density f which may or may not be in F . After every n, one must make a guess whether f 2 F or not. A class is almost surely testable if there exists such a testing sequence such that for any f , we make nitely many errors almost surely. In this paper, several results are given that allow one to decide whether a class is almos...