An extension problem (often called a boundary problem) of Markov processes has been studied, particularly in the case of one-dimensional diffusion processes, by W. Feller, K. Itô, and H. P. McKean, among others. In this book, Itô discussed a case of a general Markov process with state space S and a specified point a ∈ S called a boundary. The problem is to obtain all possible recurrent extensions of a given minimal process (i.e., the process on S \ {a} which is absorbed on reaching the boundary a). The study in this lecture is restricted to a simpler case of the boundary a being a discontinuous entrance point, leaving a more general case of a continuous entrance point to future works. He established a one-to-one correspondence between a rec...
This paper gives an upper bound for a Wasserstein distance between the distributions of a partial su...
This "splitting techniques" for Markov chains developed by Nummelin (1978a) and Athreya and Ney (197...
This book provides an undergraduate-level introduction to discrete and continuous-time Markov chains...
AbstractItô’s theory of excursion point processes is reviewed and the following topics are discussed...
For certain Markov processes, K. Ito has defined the Poisson point process of excursions away from a...
AbstractWe give an affirmative answer to Feller's boundary problem going back to 1957 by obtaining a...
AbstractItô’s contributions lie at the root of stochastic calculus and of the theory of excursions. ...
This volume is devoted to a thorough and accessible exposition on the functional analytic approach t...
This volume is devoted to a thorough and accessible exposition on the functional analytic approach t...
Summary. Let a be a non-isolated point of a topological space E. Suppose we are given standard proce...
This paper gives exact boundary crossing probabilities for finite time intervals associated with Poi...
We show that a Poisson cluster point process is a nearest-neighbour Markov point process [2] if the ...
One result that is of both theoretical and practical importance regarding point processes is the met...
AbstractAn asymptotically finite bound is derived for the total variation distance between the distr...
Abstract This paper describes methods for randomly thinning two main classes of spatial point proces...
This paper gives an upper bound for a Wasserstein distance between the distributions of a partial su...
This "splitting techniques" for Markov chains developed by Nummelin (1978a) and Athreya and Ney (197...
This book provides an undergraduate-level introduction to discrete and continuous-time Markov chains...
AbstractItô’s theory of excursion point processes is reviewed and the following topics are discussed...
For certain Markov processes, K. Ito has defined the Poisson point process of excursions away from a...
AbstractWe give an affirmative answer to Feller's boundary problem going back to 1957 by obtaining a...
AbstractItô’s contributions lie at the root of stochastic calculus and of the theory of excursions. ...
This volume is devoted to a thorough and accessible exposition on the functional analytic approach t...
This volume is devoted to a thorough and accessible exposition on the functional analytic approach t...
Summary. Let a be a non-isolated point of a topological space E. Suppose we are given standard proce...
This paper gives exact boundary crossing probabilities for finite time intervals associated with Poi...
We show that a Poisson cluster point process is a nearest-neighbour Markov point process [2] if the ...
One result that is of both theoretical and practical importance regarding point processes is the met...
AbstractAn asymptotically finite bound is derived for the total variation distance between the distr...
Abstract This paper describes methods for randomly thinning two main classes of spatial point proces...
This paper gives an upper bound for a Wasserstein distance between the distributions of a partial su...
This "splitting techniques" for Markov chains developed by Nummelin (1978a) and Athreya and Ney (197...
This book provides an undergraduate-level introduction to discrete and continuous-time Markov chains...