{"paper":{"title":"Markov chain approximations to scale functions of L\\'evy processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Aleksandar Mijatovi\\'c, Matija Vidmar, Saul Jacka","submitted_at":"2013-10-07T11:43:50Z","abstract_excerpt":"We introduce a general algorithm for the computation of the scale functions of a spectrally negative L\\'evy process $X$, based on a natural weak approximation of $X$ via upwards skip-free continuous-time Markov chains with stationary independent increments. The algorithm consists of evaluating a finite linear recursion with its (nonnegative) coefficients given explicitly in terms of the L\\'evy triplet of $X$. Thus it is easy to implement and numerically stable. Our main result establishes sharp rates of convergence of this algorithm providing an explicit link between the semimartingale charact"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.1737","kind":"arxiv","version":4},"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"}