{"paper":{"title":"On the growth rate of a linear stochastic recursion with Markovian dependence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"math.PR","authors_text":"Dan Pirjol, Lingjiong Zhu","submitted_at":"2015-05-11T23:22:18Z","abstract_excerpt":"We consider the linear stochastic recursion $x_{i+1} = a_{i}x_{i}+b_{i}$ where the multipliers $a_i$ are random and have Markovian dependence given by the exponential of a standard Brownian motion and $b_{i}$ are i.i.d. positive random noise independent of $a_{i}$. Using large deviations theory we study the growth rates (Lyapunov exponents) of the positive integer moments $\\lambda_q = \\lim_{n\\to \\infty} \\frac{1}{n} \\log\\mathbb{E}[(x_n)^q]$ with $q\\in \\mathbb{Z}_+$. We show that the Lyapunov exponents $\\lambda_q$ exist, under appropriate scaling of the model parameters, and have non-analytic be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02834","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}