Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options not deleted user 81488
10 votes

"Surprising" examples of Markov chains

Let $S_n$ be the one-dimensional nearest neighbor random walk with $ 1-q=p=P[S_{n+1}=x+1\mid S_n=x]=1-P[S_{n+1}=x-1\mid S_n=x]$, where $p\neq q$. Then, there is a (rather surprising) fact that $Y_n=| …
Serguei Popov's user avatar
1 vote
1 answer
108 views

Regularity of the entrance measure of SRW

Let $S(n)$ be the discrete sphere of radius $n$ (i.e., the internal boundary of the Euclidean discrete ball $B(n)$) centered in the origin, and consider a simple random walk starting at some $x\in\mat …
Serguei Popov's user avatar
1 vote

Regularity of the entrance measure of SRW

We now have a proof of a weaker result (only Hölderness), see Proposition 1.3 of https://arxiv.org/abs/1606.05805 . The Lipschitzness is still beyond our reach...
Serguei Popov's user avatar
5 votes

Random walk visiting a cylinder infinitely often

Well, for $d\geq 2$, the projection of $S_n$ onto a hyperplane orthogonal to $\vec{p}$ is a zero-mean $(d-1)$-dimensional random walk with bounded jumps. Therefore, the answer to your question is ''ye …
Serguei Popov's user avatar
0 votes

The necessary sufficient condition for recurrence of a Markovian random walk

No, it's not sufficient, you need assumptions on the tails of $\sigma$'s. See Chapter 5 of http://www.ime.unicamp.br/~popov/book_lyapunov.pdf
Serguei Popov's user avatar