Ulam's History-dependent Random Adding Process

Abstract

Ulam has defined a history-dependent random sequence of integers by the recursion Xn+1 = XU(n)+XV(n), n ≥slant r where U(n) and V(n) are independently and uniformly distributed on \1,…,n\, and the initial sequence, X1=x1,…,Xr=xr, is fixed. We consider the asymptotic properties of this sequence as n ∞, showing, for example, that n-2 Σk=1n Xk converges to a non-degenerate random variable. We also consider the moments and auto-covariance of the process, showing, for example, that when the initial condition is x1 =1 with r =1, then n ∞ n-2 E X2n = (2 π)-1 (π); and that for large m < n, we have (m n)-1 E Xm Xn (3 π)-1 (π). We further consider new random adding processes where changes occur independently at discrete times with probability p, or where changes occur continuously at jump times of an independent Poisson process. The processes are shown to have properties similar to those of the discrete time process with p=1, and to be readily generalised to a wider range of related sequences.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…