Abstract
Let G be an infinite connected graph with vertex set V. Let {Sn:n∈N0} be the simple random walk on G and let {ξ(v):v∈V} be a collection of i.i.d. random variables which are independent of the random walk. Define the random walk in random scenery as Tn= ∑k=0nξ(Sk), and the normalization variables Vn=(∑k=0nξ2(Sk))1∕2 and Ln,2=(∑v∈Vln2(v))1∕2. For G=Zd and G=Td, the d-ary tree, we provide large deviations results for the self-normalized process Tnn∕(L n,2Vn) under only finite moment assumptions on the scenery.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.