A discrete-time Matsumoto-Yor theorem

Abstract

We study a random walk on the subgroup of lower triangular matrices of SL2, with i.i.d. increments. We prove that the process of the lower corner of the random walk satisfies a Rogers-Pitman criterion to be a Markov chain if and only if the increments are distributed according to a Generalized Inverse Gaussian (GIG) law on their diagonals. For this, we prove a new characterization of these laws. We prove a discrete-time version of the Dufresne identity. We show how to recover the Matsumoto-Yor theorem by taking the continuous limit of the random walk.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…