15 October 2021 in Journal of the European Mathematical Society
Let {(g_{n})_{n\geq 1}} be a sequence of independent and identically distributed (i.i.d.) {d\times d} real random matrices. For {n\geq 1} set {G_n = g_n \ldots g_1} . Given any starting point {x=\mathbb R v\in\mathbb{P}^{d-1}} , consider the Markov chain {X_n^x = \mathbb R G_n v } on the projective space {\mathbb P^{d-1}} and define the norm cocycle by {\sigma(G_n, x)= \log (|G_n v|/|v|)} , for an arbitrary norm {|\cdot|} on \smash{\mathbb R^{d}} . Under suitable conditions we prove a Berry–Esseen-type theorem and an Edgeworth expansion for the couple {(X_n^x, \sigma(G_n, x))} . These results are established using a brand new smoothing inequality on complex plane, the saddle point method and additional spectral gap properties of the transfer operator related to the Markov chain {X_n^x} . Cramér-type moderate deviation expansions as well as a local limit theorem with moderate deviations are proved for the couple {(X_n^x, \sigma(G_n, x))} with a target function {\varphi} on the Markov chain {X_n^x} .
1 February 2025 in Annales de l'Institut Henri Poincaré, Probabilités et Statistiques
Considérons une marche aléatoire Sn=∑ i=1nXi avec des incréments Xi à valeur réelles indépendants et identiquement distribués de moyenne nulle et de variance finie. Supposons que Xi ne soit pas contenu dans un réseau et ait un moment d’ordre 2+δ. Pour tout point de départ x≥0, soit τx=inf{k≥1:x+Skn) et celui de l’espérance E(f(x+Sn−y),τx>n) pour une grande classe de fonctions cible f et diverses valeurs de x, y qui peuvent éventuellement dépendre de n. Ce cadre général conduit à des théorémes limites pour la distribution conjointe P(x+Sn∈y+[0,Δ],τx>n), où Δ>0 peut également dépendre de n. En particulier, le cas des écarts modérés y=σqnlogn est considéré. Nous en déduisons également de nouvelles estimations asymptotiques pour les marches aléatoires avec dérive et donnons des constantes explicites dans l’asymptotique de la probabilité P(τx=n). Pour les preuves, nous établissons de nouveaux théorèmes limites intégraux conditionnés avec des termes d’erreur précis.
25 February 2025 in Journal of Theoretical Probability
20 March 2023 in Ergodic Theory and Dynamical Systems
Let be a subshift of finite type equipped with the Gibbs measure and let f be a real-valued Hölder continuous function on such that . Consider the Birkhoff sums , . For any , denote by the first time when the sum leaves the positive half-line for some . By analogy with the case of random walks with independent and identically distributed increments, we study the asymptotic as of the probabilities and . We also establish integral and local-type limit theorems for the sum conditioned on the set
1 January 2025 in Electronic Journal of Probability
Let (gn)n⩾1 be a sequence of independent and identically distributed random elements with law μ on the general linear group GL(V), where V=Rd. Consider the random walk Gn:=gn⋯g1, n⩾1. Under suitable conditions on μ, we establish the first order Edgeworth expansion for the coefficients ⟨f,Gnv⟩ with v∈V and f∈V∗. Our result is established under the sole irreducibility and proximality condition, together with finiteness of an exponential moment, thus avoiding a stronger Cramér-type assumption which is usual for higher order expansions as, for instance, in [14].
12 December 2024 in arXiv
Consider a random walk $S_n=\sum_{i=1}^n X_i$ with independent and identically distributed real-valued increments with zero mean, finite variance and moment of order $2 + δ$ for some $δ>0$. For any starting point $x\in \mathbb R$, let $τ_x = \inf \left\{ k\geq 1: x+S_{k} < 0 \right\}$ denote the first time when the random walk $x+S_n$ exits the half-line $[0,\infty)$. We investigate the uniform asymptotic behavior over $x\in \mathbb R$ of the persistence probability $\mathbb P (τ_x >n)$ and the joint distribution $\mathbb{P} \left( x + S_n \leq u, τ_x > n \right)$, for $u\geq 0$, as $n \to \infty$. New limit theorems for these probabilities are established based on the heat kernel approximations. Additionally, we evaluate the rate of convergence by proving Berry-Esseen type bounds.