Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Imagine that I have a random walk on an $N$-dimensional integer lattice, $Z^N$, of finite dimensions, $(d_1, ..., d_N)$, where boundaries are fully reflecting and the walker is initialized at some point: $(d_{1_0}, d_{2_0}, ..., d_{N_0})$.

Here, the probability for a walker to take a step towards any of the reflecting boundaries is biased - $(P[d_1],...,P[d_{2N}])$, $Sum(P[d_1],...,P[d_{2N}])=1$? Unlike the unbiased case, the probability of taking a step towards any reflecting boundary (except at the edges of the graph) is no longer $(1/2N)$.

How well can we estimate the cover time of $Z_N$ for this biased random walk?


The cover time for an unbiased random walk on $Z^N$ was answered by Andreas RĂ¼dinger in a previous question: (Expected number of steps for a discrete random walk to visit every point on an N-dimensional rectangular lattice)

He cites the paper "Jonasson, Schramm, ON THE COVER TIME OF PLANAR GRAPHS, Elect. Comm. in Probab. 5 (2000) 85-90. (http://www.emis.de/journals/EJP-ECP/_ejpecp/ECP/include/getdocbfb7.pdf).

share|improve this question
    
arxiv.org/abs/1004.4371 –  Steve Huntsman Jun 14 '11 at 20:23

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.