2011
DOI: 10.1017/s0001867800005140
|View full text |Cite
|
Sign up to set email alerts
|

Limit theorems for some continuous-time random walks

Abstract: In this paper we consider the scaled limit of a continuous-time random walk (CTRW) based on a Markov chain {X n , n ≥ 0} and two observables, τ (·) and V (·), corresponding to the renewal times and jump sizes. Assuming that these observables belong to the domains of attraction of some stable laws, we give sufficient conditions on the chain that guarantee the existence of the scaled limits for CTRWs. An application of the results to a process that arises in quantum transport theory is provided. The results obta… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 19 publications
0
4
0
Order By: Relevance
“…The latter can be interpreted as the evolution of the density of a Markov process. In [13], [15], the authors study the long time behavior of additive functionals of this Markov process and deduce that the long-time, large-scale limit of the solution of the previous Boltzmann equation converges to the solution of the fractional heat equation:…”
Section: Introductionmentioning
confidence: 99%
“…The latter can be interpreted as the evolution of the density of a Markov process. In [13], [15], the authors study the long time behavior of additive functionals of this Markov process and deduce that the long-time, large-scale limit of the solution of the previous Boltzmann equation converges to the solution of the fractional heat equation:…”
Section: Introductionmentioning
confidence: 99%
“…Coupling methods different from forward-/backward-coupling can be found in [6,23], where certain correlations between the waiting times, respectively between the jumps were introduced. A similar approach in a more general setting appears in [13], where coupling is introduced through a Markov chain (Y n ) n∈N and waiting times, respectively jumps are modelled by (J n = τ (Y n ), X n = V (Y n )) for some measurable functions τ, V with values in (0, ∞), respectively R. Note that these couplings in general do not fulfill our i.i.d. assumption on the sequence (J n , X n ) n∈N .…”
Section: Introductionmentioning
confidence: 99%
“…The following result is a simpler version of Proposition 4.1 and Theorem 2.5(i) of [12], see also Theorem 2.4 of [13] and Theorem 3.2 of [5]. Proposition 4.2 Suppose that β > 1 and (y, k) ∈ R * × T * .…”
Section: Convergence Of Processes Without An Interfacementioning
confidence: 99%