For questions on random walks, a mathematical formalization of a path that consists of a succession of random steps.

learn more… | top users | synonyms

0
votes
0answers
13 views

Optimal stopping strategy

I try to solve the following problem : Given a series of random variables : X1,X2,... such that each one can get either -1 or 1 with probability 0.5, give a strategy to maximize the expected value of ...
-3
votes
0answers
28 views

expected first passage time of a simple random walk [closed]

For a symmetric, simple random walk on $S={0,1,...,k}$ let $T=\min\{n \in \mathbb N\ | \ X_{0}=x\}$ and $a_{x}=E(T|X_{0}=x)$ show that $a_{x}$ satisfies $a_{x}=0.5a_{x-1} + 0.5a_{x+1} + 1$ for $x ...
1
vote
1answer
29 views

Independence of random variables derived from a Random walk

Let $w=(w_x)_{x \in \mathbb Z}$ be i.i.d random variables taking values in $(0,1)$. Let $(X_n)_{n \in \mathbb{N}_0} (\mathbb{N} \cup {0})$ be a Markov chain (more specifically a simple random walk ...
0
votes
0answers
17 views

1-D random walk weighted towards the origin

I would like to model a random walk in one dimension where the walker is attached to the origin by a rubber band, such that the walker's probability of moving toward origin increases with the distance ...
5
votes
0answers
41 views

Probability on entering direction of a simple random walk

Let $X(n)$ be a simple random walk on $\Bbb{Z}^2$. Also we define $S_{R} = \inf\{n > 0 : X(n) \notin [-R, R]^2 \} $ : the exit time of the square $[-R, R]^2$, $T_{v} = \inf\{n > 0 : X(n) = ...
0
votes
1answer
44 views

Why the probability of a sequence is simply the multiplication?

In studying the random walk in one dimension I had a doubt on basic probability. The point is the following: we consider a random walk with $N$ steps consiting of $n_1$ steps to the right and $n_2$ ...
9
votes
0answers
107 views

Expected range of simple random walk in $\mathbb{Z^2}$

Let $(Y_k)_{k\geq0}$ be a simple random walk process. The range of an $n$-step random walk, $R_n$, is a random variable that characterizes the number of distinct points visited at time $n$: ...
0
votes
0answers
36 views

The characteristic function for the random walk

I want to determine the characteristic function of the probability distribution of a random walk. The probability distribution of a random walk is: ...
1
vote
1answer
66 views

Expectation and Variance of random walks

Consider random walks of fixed length (e.g. $5$) starting at node $u$ in an undirected and connected graph with $N$ vertices. If a node $k$ has $N_k$ edges, the probability of the walk reaching any of ...
0
votes
1answer
14 views

$\sqrt{n}$ in scaled random walk

In a reference, it is stated that $W^{(n)}(t)=\frac {1}{\sqrt{n}}M_{nt}$ with : $W^{(n)}(t)$ as scaled random walk and $M_{nt}=\sum_{j=1}^{nt}X_j$. Where does $\sqrt{n}$ come from? Would you ...
0
votes
1answer
26 views

Probability - Random Walk Type Problem

Suppose two teams play a series of games, each producing a winner and a loser, until one time has won two more games than the other. Let G be the number of games played until this happens. Assuming ...
0
votes
0answers
30 views

diffusion- stuck

In a round room of radius R, a large number of coins N of diameter d are randomly dispersed upon the floor. A ladybird starts from the centre of the room, crawling at speed v. Suppose that every time ...
0
votes
0answers
28 views

Random Walks - $n$ particles on a $n-clique$

We take $n$ particles and put them on $v$, a vertex in $n$-size Clique $G$, where each vertex has a loop to itself. Each particle does a Random Walk on the clique and the $n$ Random Walks are ...
4
votes
1answer
39 views

Random walk with finite expected stopping time

Let's say each $X_i$ is a simple random variable taking on values 1 or -1 with probability $1/2$ each. Then $S_n = \sum_{i=1}^{n} X_i$ is a random walk. Set $T = \min \{n\in\mathbb{N} \, : \, S_n = ...
0
votes
0answers
6 views

compare hitting time of two random walks with reset action

Let $s^i_k = s^i_{k-1} + x^i_k$ with $s^i_0 = 0$ for $i=1,2$. Additional constraint on $s^i_k$ is that $s^i_k$ cannot be negative, i.e., $s^i_k$ is reset to be zero whenever it becomes negative. The ...
1
vote
0answers
16 views

a problem on random walk and maximu of its summation

Suppose $X_n$ is random walk with $P(X_n=1)=1-P(X_n=-1)=p=1-q$. $M_n=\max_{1\le i\le n} S_i$, $Y_n=M_n-S_n, T_a=\min\{S_n=a\}$. Find $P(\max_{0\le k\le T_a} Y_k <y).$
2
votes
1answer
39 views

$E(S_T^2)\not=E (\sum_{i=1}^T \sigma_i^2) $ when $E|T|<\infty$

I am currently learning random walk and come across a problem concerning stopping time. The question asks to give an example that $X_1,X_2,...$ independent r.v. with mean $0$ and variance ...
1
vote
1answer
26 views

Why random walk sample path seen as if it is continuous-time stochastic process?

Random walk is a discrete-time stochastic process. In many references, instead of using dots to draw its sample path, why does random walk use line-styled graph as if it is a continuous-time ...
3
votes
2answers
40 views

Random walk on a tree

Consider a Cayley tree with coordination number 3 (http://en.wikipedia.org/wiki/Bethe_lattice). Consider two sites, $x$ and $y$, having a distance $k$ one from another. What is the probability that ...
1
vote
0answers
35 views

Maximum of *Absolute Value* of a Random Walk

Suppose that $S_{n}$ is a simple random walk started from $S_{0}=0$. Denote $M_{n}^{*}$ to be the maximum absolute value of the walk in the first $n$ steps, i.e., $M_{n}^{*}=\max_{k\leq ...
0
votes
1answer
15 views

Let $S_n$ be a Simple Random Walk. What is $E[S_m|S_n]$ if $m < n$?

Let $S_n = W_1 + ... + W_n$ be a simple random walk with $W_i$ IID and $P[W_i = 1] = P[W_i = -1] = 1/2$. Find $E[S_m | S_n]$ when (a) $m > n$ and (b) $m < n$. For part (a), I get the answer of ...
1
vote
4answers
39 views

Expected number of steps

I play a game as follows. A bucket contains four red balls and three green balls. At each step, a ball is chosen at random from the bucket, with each of the balls there being equally likely to be ...
2
votes
2answers
94 views

Bounding profits of gambler by Azuma Inequality

A gambler plays the following game: In each round, he can pay any $0 < p < 1$ dollars, and win 1 dollar with probability p (independently). Show that the probability that the gambler's net ...
0
votes
1answer
130 views

Random Surfer as a Markov Chain

Consider a random surfer who begins at a web page (a node of the web graph) and executes a random walk on the Web as follows. At each time step, the surfer proceeds from his current page A to a ...
0
votes
1answer
90 views

Deducing results about continuous time random walks from the corresponding discrete time result

Is there any standard way to prove results about continuous time random walks from the corresponding results for discrete time random walks? Specifically, my problem is that I was reading Lawler and ...
1
vote
0answers
27 views

Cicurlar random-walk.

Suppose you have a computer network with 5 code as following. Packet can arrive at any node and any other node can be its destination equal uniform probability. Determine the average number of ...
0
votes
0answers
29 views

Random-walk in a pentacle (5 nodes)

There are a total of 5 nodes at the edge of a pentagram At each node, you have a 4 choices which will lead you to either a destination node or non-destination node. Assume the decision of path is ...
1
vote
1answer
100 views

Couple/Compare two stochastic processes and prove an intuitive proposition

Consider a stochastic process (denoted $X$) $X_0, X_1, X_2, \ldots$ (not necessarily a Markov Chain) over state space $\{0, 1, \cdots, n \}$. The transition probabilities are ($n$ is the sink state) ...
0
votes
0answers
24 views

Simple Random Walk; Proof hitting theorem; Ballot Theorem

Suppose that $(X_{n}:n\in\mathbb{N})$ is a $\pm1\mbox{-valued sequence.}$ Let $p\in(0,1)$ and $p=\mathbb{P}(X_{i}=1)\mbox{ and}\mathbb{P}(X_{i}=-1)=1-p=q$ . Define the simple random walk ...
1
vote
0answers
59 views

Probability of going to the origin in a random walk

Been given this as practice for my Stochastic Processes course. I'm fairly new to the concept, so I haven't been exposed to a general method. Any hints/tips for the following? A gambler plays a ...
3
votes
0answers
71 views

Duration of a Gambler's Ruin game against an opponent with infinite credit

A gambler enters the casino with $x\$$ in his pocket and sits on some table. At each iteration he bets $1\$$ and either wins $1\$$ with probability $p\leq\frac{1}{2}$ or loses $1\$$. Assuming that ...
2
votes
1answer
105 views

Showing that lim sup of sum of iid binary variables $X_i$ with $P[X_i = 1] = P[X_i = -1] = 1/2$ is a.s. infinite

Let $(X_i)_{i\in\mathbb{N}}$ be an i.i.d. sequence of binary random variables with $$P[X_i = 1]=P[X_i = -1] = \frac{1}{2}$$ and let $$S_n = \sum_{i=1}^{n} X_i.$$ I'd like to show that $$P[\lim ...
1
vote
1answer
79 views

Probability- Coin Flipping Game

If you play a game where you flip a coin if it lands heads you win £1 and tails you lose £1.If you start with $£K$ what is the probability that you are bankrupt after $n$ games? MY ATTEMPT I ...
2
votes
1answer
72 views

Expected number of moves of a random walk inside a simplex

Few days ago, Roger Blazey, retired head maths teacher, at LinkedIn group told about the following problem: “This problem was raised as part of a lecture at The Biennial AAMT (Australian ...
1
vote
0answers
42 views

Bound on sum random variables and Martingales

Suppose $X_n=q$ with probability $p$, and $X_n=-p$ with probability $q$ where $p+q=1$. Prove that for every $n$, the probability that $S_k\geq b$ for any $k$ as $1\leq k \leq n$ is at most ...
0
votes
1answer
129 views

Expectation of hitting time for simple symmetric random walk

Assume there is a simple symmetric random walk $$S_n=X_1+...+X_n,\quad S_0=0$$ where $\mathbb P(X_i=\pm 1)=\frac{1}{2}$. Define $T=\inf\{n:S_n=1\}$. How to compute $\mathbb E(T)$? My idea: if ...
0
votes
0answers
45 views

Maximum time-to-exit of random walk in R^n

I am trying to solve the following problem : Given a set $A$ in $\mathbb{R}^n$ and a point $p$ , I want to find a convex subset of $A$, call it $C$, such that $p$ is in $C$ and random walk starting at ...
4
votes
2answers
161 views

better expression for simple random walk

Let $P_{k,j}$ be the probability that a simple symmetric random walk starting from the origin reaches the point $k \in \mathbb{N}$ precisely in $j$ steps without ever returning to the origin. ...
1
vote
1answer
78 views

A question about independence of sigma algebras (generated by random variables)

Let $X_1, X_2, \ldots$ i.i.d random variables. Is it possible that $$\{X_{n+1} \in B\} \in \sigma({X_1, \ldots, X_n})$$ for some $B$? Why yes/not? I want to show that $\sigma(X_{n+1})$ and ...
2
votes
0answers
21 views

Estimating the discrete laplacian to prove recurrence of simple random walk for d=2

Given a function $f : \mathbb Z\times \mathbb Z \rightarrow \mathbb{R}$ we define the discrete laplacian of $f$, $\triangle_df$, by the following rule $\triangle_df(x,y)= \dfrac{f(x + 1, y)+f(x, y + ...
0
votes
0answers
47 views

continuous random walks, wiener process, ito process: “snowballing” for high enough volatility?

I'm finishing a project for my ODE class and ran into some strange behavior involving a SDE (not exactly sure how to say this, but...) generated by an Ito process, using the Wiener process. I guess ...
1
vote
1answer
53 views

Brownian motion is almost surely continuous

Why is Brownian motion required to be almost surely continuous instead of merely continuous? For example, this is stated as condition 2 in this article in section 1, Characterizations of the Wiener ...
1
vote
0answers
23 views

What are the assumptions for applying Wald's equation with a stopping time

I am trying to understand the assumptions under which I am allowed to apply Wald's equation for a sum of a random number $N$ of random variables $X_n$, $1\leq n\leq N$. There seem to be several ...
1
vote
1answer
29 views

Expectation of constraint random walk

Problem description I am currently dealing with a practical problem that can be simplified to something like this: I start by setting a value to 0 Every minute, I try to increase or decrease 1 or ...
3
votes
0answers
35 views

Random walks and their uses

Can anyone provide some motivation behind the use of random walks? I know they're used a lot in computer science, in things like page walk (I think that's what it was called- something like pagerank), ...
0
votes
3answers
82 views

Random walk on the real line

A particle stands on the origin of real line. In every second it jumps one unit to the left or right by the probability $\frac{1}{2}$. what is a probability that it reach to point $+1$?
2
votes
1answer
69 views

random walk on finite cyclic group

Suppose that I have a random walk on the finite cyclic group of order $d > 2$, where the initial probability distribution $Q$ assigns the values $p, q, r$ to $-1, 0, 1$, respectively, where $p + q ...
0
votes
1answer
45 views

Simple Random Walk and $n$th zero hitting time

I am reading an example in Durrett's book regarding the $n$th time the random walk hits 0. Consider a simple random walk, $X_i=1$ or $X_i = -1$ with equal probability. Let $S_n = X_1 + \dots + X_n$. ...
1
vote
0answers
22 views

Power law in power spectrum and memory.

If we generate white noise and do the FFT of it, we get the same amplitude for each of the frequencies. Therefore, the output of the FFT of the noise follows approximately the power law ...
1
vote
1answer
52 views

Random Walk on Clock Hands

We do a random walk on a clock. Each step the hour hand moves clockwise or counterclockwise each with probability 1/2 independently of previous steps. If you start at 1 what is the expected number ...