2018
DOI: 10.48550/arxiv.1808.00129
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Recurrent extensions of real-valued self-similar Markov processes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 0 publications
0
2
0
Order By: Relevance
“…This extension defines a bijection between the set of these processes and this of S d−1 ×R-valued Markov additive processes, where S d−1 is the sphere in dimension d. Actually this representation does not provide a complete description of R d -valued self-similar Markov processes since it does not give any information on the existence of an entrance law at 0 or a recurrent extension after the first passage time at 0. Regarding these questions, only the real case has been investigated up to now, see [15], [9], [13] and the references therein.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…This extension defines a bijection between the set of these processes and this of S d−1 ×R-valued Markov additive processes, where S d−1 is the sphere in dimension d. Actually this representation does not provide a complete description of R d -valued self-similar Markov processes since it does not give any information on the existence of an entrance law at 0 or a recurrent extension after the first passage time at 0. Regarding these questions, only the real case has been investigated up to now, see [15], [9], [13] and the references therein.…”
Section: Introductionmentioning
confidence: 99%
“…Let us emphasize that most of our results would not apply for d = 1. However in the latter case multi-self-similar Markov processes coincide with self-similar Markov processes which have already been extensively studied in the literature, see [12], [4], [9], [15] or [13], for instance.…”
Section: Introductionmentioning
confidence: 99%