Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOptimal prediction for positive self-similar Markov processes
279
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
This paper addresses the question of predicting when a positive self-similar Markov process X attains its pathwise global supremum or infimum before hitting zero for the first time (if it does at all). This problem has been studied in Glover et al. (2013) under the assumption that X is a positive transient diffusion. We extend their result to the class of positive self-similar Markov processes by establishing a link to Baurdoux and van Schaik (2013), where the same question is studied for a Levy process drifting to minus infinity. The connection to Baurdoux and van Schaik (2013) relies on the so-called Lamperti transformation which links the class of positive self-similar Markov processes with that of Levy processes. Our approach will reveal that the results in Glover et al. (2013) for Bessel processes can also be seen as a consequence of self-similarity.
rate research
Read More
For a positive self-similar Markov process, X, we construct a local time for the random set, $Theta$, of times where the process reaches its past supremum. Using this local time we describe an exit system for the excursions of X out of its past supremum. Next, we define and study the ladder process (R,H) associated to a positive self-similar Markov process X, namely a bivariate Markov process with a scaling property whose coordinates are the right inverse of the local time of the random set $Theta$ and the process X sampled on the local time scale. The process (R,H) is described in terms of a ladder process linked to the L{e}vy process associated to X via Lampertis transformation. In the case where X never hits 0, and the upward ladder height process is not arithmetic and has finite mean, we prove the finite-dimensional convergence of (R,H) as the starting point of X tends to 0. Finally, we use these results to provide an alternative proof to the weak convergence of X as the starting point tends to 0. Our approach allows us to address two issues that remained open in Caballero and Chaumont [Ann. Probab. 34 (2006) 1012-1034], namely, how to remove a redundant hypothesis and how to provide a formula for the entrance law of X in the case where the underlying L{e}vy process oscillates.
We prove that a positive self-similar Markov process $(X,mathbb{P})$ that hits 0 in a finite time admits a self-similar recurrent extension that leaves 0 continuously if and only if the underlying L{e}vy process satisfies Cram{e}rs condition.
Our purpose is to study a particular class of optimal stopping problems for Markov processes. We justify the value function convexity and we deduce that there exists a boundary function such that the smallest optimal stopping time is the first time when the Markov process passes over the boundary depending on time. Moreover, we propose a method to find the optimal boundary function.
In this paper, we consider the optimal stopping problem on semi-Markov processes (SMPs) with finite horizon, and aim to establish the existence and computation of optimal stopping times. To achieve the goal, we first develop the main results of finite horizon semi-Markov decision processes (SMDPs) to the case with additional terminal costs, introduce an explicit construction of SMDPs, and prove the equivalence between the optimal stopping problems on SMPs and SMDPs. Then, using the equivalence and the results on SMDPs developed here, we not only show the existence of optimal stopping time of SMPs, but also provide an algorithm for computing optimal stopping time on SMPs. Moreover, we show that the optimal and -optimal stopping time can be characterized by the hitting time of some special sets, respectively.
Persistent homology provides a robust methodology to infer topological structures from point cloud data. Here we explore the persistent homology of point clouds embedded into a probabilistic setting, exploiting the theory of point processes. We provide variants of notions of ergodicity and investigate measures on the space of persistence diagrams. In particular we introduce the notion of self-similar scaling of persistence diagram expectation measures and prove a packing relation for the occurring dynamical scaling exponents. As a byproduct we generalize the strong law of large numbers for persistent Betti numbers proven in [Hiraoka et al., Ann. Appl. Probab. 28(5), 2018] for averages over cubes to arbitrary convex averaging sequences.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
