Related papers: Stopped processes and Doob's optional sampling the…
In this paper we present some new limit theorems for power variation of $k$th order increments of stationary increments L\'evy driven moving averages. In the infill asymptotic setting, where the sampling frequency converges to zero while…
When auxiliary information is available at the design stage, samples may be selected by means of balanced sampling. Deville and Tille proposed in 2004 a general algorithm to perform balanced sampling, named the cube method. In this paper,…
We generalize the notion of the submartingale property and Doob's inequality. Furthermore, we show how the latter leads to new inequalities for several stochastic processes: certain time series, Levy processes, random walks, processes with…
In this paper, we study one dimensional Markov processes with spatial delay. Since the seminal work of Feller, we know that virtually any one dimensional, strong, homogeneous, continuous Markov process can be uniquely characterized via its…
We propose \textit{DeepMartingale}, a deep-learning framework for the dual formulation of discrete-monitoring optimal stopping problems under continuous-time models. Leveraging a martingale representation, our method implements a…
One of the main objectives of topological data analysis is the study of discrete invariants for persistence modules, in particular when dealing with multiparameter persistence modules. In many cases, the invariants studied for these…
We consider the problem of conditioning a Markov process on a rare event and of representing this conditioned process by a conditioning-free process, called the effective or driven process. The basic assumption is that the rare event used…
We show that if either the process is strong Feller and the boundary point is probabilistically regular for the stopping set, or the process is strong Markov and the boundary point is probabilistically regular for the interior of the…
We obtain SMEFT bounds using an approach that utilises the complete multi-dimensional differential information of a process. This approach is based on the fact that at a given EFT order, the full angular distribution in the most important…
It has been known for some time that the Green's function of a planar domain can be defined in terms of the exit time of Brownian motion, and this definition has been extended to stopping times more general than exit times. In this paper,…
Let L be a positive line bundle over a projective complex manifold X. Consider the space of holomorphic sections of the tensor power of order p of L. The determinant of a basis of this space, together with some given probability measure on…
This paper studies the \emph{subset sampling} problem. The input is a set $\mathcal{S}$ of $n$ records together with a function $\textbf{p}$ that assigns each record $v\in\mathcal{S}$ a probability $\textbf{p}(v)$. A query returns a random…
The Markov assumption in Markov Decision Processes (MDPs) is fundamental in reinforcement learning, influencing both theoretical research and practical applications. Existing methods that rely on the Bellman equation benefit tremendously…
Let $\{X_i(t),t\ge0\}, 1\le i\le n$ be independent copies of a stationary process $\{X(t), t\ge0\}$. For given positive constants $u,T$, define the set of $r$th conjunctions $ C_{r,T,u}:= \{t\in [0,T]: X_{r:n}(t) > u\}$ with $X_{r:n}(t)$…
We propose a new method for solving optimal stopping problems (such as American option pricing in finance) under minimal assumptions on the underlying stochastic process $X$. We consider classic and randomized stopping times represented by…
The halting problem is undecidable --- but can it be solved for "most" inputs? This natural question was considered in a number of papers, in different settings. We revisit their results and show that most of them can be easily proven in a…
In recent work, Chaumont et al. [9] showed that is possible to condition a stable process with index ${\alpha} \in (1,2)$ to avoid the origin. Specifically, they describe a new Markov process which is the Doob h-transform of a stable…
Optimal convergence rates of adaptive finite element methods are well understood in terms of the axioms of adaptivity. One key ingredient is the discrete reliability of a residual-based a posteriori error estimator, which controls the error…
Learning representation from relative similarity comparisons, often called ordinal embedding, gains rising attention in recent years. Most of the existing methods are based on semi-definite programming (\textit{SDP}), which is generally…
We study the limiting behavior of continuous time trawl processes which are defined using an infinitely divisible random measure of a time dependent set. In this way one is able to define separately the marginal distribution and the…