Large Deviation Principles for Random Walk Trajectories. II

2013 ◽  
Vol 57 (1) ◽  
pp. 1-27 ◽  
Author(s):  
A. A. Borovkov ◽  
A. A. Mogulskii
Keyword(s):  
Random Walk ◽  
Large Deviation ◽  
Large Deviation Principles

scholarly journals Chover-Type Laws of the Iterated Logarithm for Kesten-Spitzer Random Walks in Random Sceneries Belonging to the Domain of Stable Attraction

2018 ◽  
Vol 2018 ◽  
pp. 1-9
Author(s):  
Wensheng Wang ◽  
Anwei Zhu
Keyword(s):  
Random Walk ◽  
Large Deviation ◽  
Sufficient Conditions ◽  
Random Variables ◽  
Domain Of Attraction ◽  
Stable Law ◽  
Iterated Logarithm ◽  
Cluster Set ◽  
Random Scenery ◽  
Unique Integer

Let X={Xi,i≥1} be a sequence of real valued random variables, S0=0 and Sk=∑i=1kXi  (k≥1). Let σ={σ(x),x∈Z} be a sequence of real valued random variables which are independent of X’s. Denote by Kn=∑k=0nσ(⌊Sk⌋)  (n≥0) Kesten-Spitzer random walk in random scenery, where ⌊a⌋ means the unique integer satisfying ⌊a⌋≤a<⌊a⌋+1. It is assumed that σ’s belong to the domain of attraction of a stable law with index 0<β<2. In this paper, by employing conditional argument, we investigate large deviation inequalities, some sufficient conditions for Chover-type laws of the iterated logarithm and the cluster set for random walk in random scenery Kn. The obtained results supplement to some corresponding results in the literature.

scholarly journals Large deviations in non-uniformly hyperbolic dynamical systems

2008 ◽  
Vol 28 (2) ◽  
pp. 587-612 ◽  
Author(s):  
LUC REY-BELLET ◽  
LAI-SANG YOUNG
Keyword(s):  
Dynamical Systems ◽  
Generating Functions ◽  
Limit Theorems ◽  
Large Deviation ◽  
Return Times ◽  
Hyperbolic Diffeomorphisms ◽  
Large Deviation Principles ◽  
Hyperbolic Dynamical Systems ◽  
Rank One ◽  
Dispersing Billiards

AbstractWe prove large deviation principles for ergodic averages of dynamical systems admitting Markov tower extensions with exponential return times. Our main technical result from which a number of limit theorems are derived is the analyticity of logarithmic moment generating functions. Among the classes of dynamical systems to which our results apply are piecewise hyperbolic diffeomorphisms, dispersing billiards including Lorentz gases, and strange attractors of rank one including Hénon-type attractors.

scholarly journals Approximation of bounds on mixed-level orthogonal arrays

2011 ◽  
Vol 43 (02) ◽  
pp. 399-421
Author(s):  
Ali Devin Sezer ◽  
Ferruh Özbudak
Keyword(s):  
Random Walk ◽  
Large Deviation ◽  
Recursive Algorithm ◽  
Markov Property ◽  
Orthogonal Arrays ◽  
Recursive Formula ◽  
Limit Problem ◽  
Simulation Algorithm ◽  
Bellman Equations ◽  
Combinatorial Representations

Mixed-level orthogonal arrays are basic structures in experimental design. We develop three algorithms that compute Rao- and Gilbert-Varshamov-type bounds for mixed-level orthogonal arrays. The computational complexity of the terms involved in the original combinatorial representations of these bounds can grow fast as the parameters of the arrays increase and this justifies the construction of these algorithms. The first is a recursive algorithm that computes the bounds exactly, the second is based on an asymptotic analysis, and the third is a simulation algorithm. They are all based on the representation of the combinatorial expressions that appear in the bounds as expectations involving a symmetric random walk. The Markov property of the underlying random walk gives the recursive formula to compute the expectations. A large deviation (LD) analysis of the expectations provides the asymptotic algorithm. The asymptotically optimal importance sampling (IS) of the same expectation provides the simulation algorithm. Both the LD analysis and the construction of the IS algorithm use a representation of these problems as a sequence of stochastic optimal control problems converging to a limit calculus of a variations problem. The construction of the IS algorithm uses a recently discovered method of using subsolutions to the Hamilton-Jacobi-Bellman equations associated with the limit problem.

Sign in / Sign up

Export Citation Format

Share Document