Math 2.0

definition

Random walk

Definition

Let d≥1d \ge 1, let x0∈Rdx_0 \in \mathbb{R}^d, and let ξ1,ξ2,…\xi_1, \xi_2, \dots be i.i.d. random vectors in Rd\mathbb{R}^d. The random walk with start x0x_0 and steps ξi\xi_i is the stochastic process (Sn)n≥0(S_n)_{n \ge 0} with S0=x0andSn=x0+ξ1+⋯+ξnfor n≥1.S_0 = x_0 \quad \text{and} \quad S_n = x_0 + \xi_1 + \dots + \xi_n \quad \text{for } n \ge 1. The simple random walk on Z\mathbb{Z} has d=1d = 1, x0=0x_0 = 0 and P(ξi=1)=P(ξi=−1)=1/2P(\xi_i = 1) = P(\xi_i = -1) = 1/2.

Remarks

For the simple random walk on Z\mathbb{Z}, E[Sn]=0E[S_n] = 0 and Var⁡(Sn)=n\operatorname{Var}(S_n) = n. By the central limit theorem, Sn/nS_n/\sqrt{n} converges in distribution to N(0,1)\mathcal{N}(0, 1). The simple random walk on Zd\mathbb{Z}^d returns to its start with probability 11 if d≤2d \le 2, and with probability less than 11 if d≥3d \ge 3. This is Pólya's theorem. A random walk is a Markov chain with transition probabilities that do not change under translation. After scaling of time and space, the simple random walk converges to the Wiener process.

Explanations

L1 human

A random walk is the path of someone who, at each step, chooses a direction at random. It models the price of a share, the motion of a particle in a fluid, and the fortune of a gambler.

What this node needs for W2
  • edge instance_of in: one example (0 of 1)
  • edge not_instance_of in: one non-example that fails one clause (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What depends on this

1 node uses this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Random_walk, One-dimensional random walk