A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Random walk with long-range constraints

2014
*
Electronic Journal of Probability
*

E l e c t r o n i c J o u r n a l o f P r o b a b i l i t y Electron. Abstract We consider a model of a random height function with long-range constraints on a discrete segment. This model was suggested by Benjamini, Yadin and Yehudayoff and is a generalization of simple random walk. The random function is uniformly sampled from all graph homomorphisms from the graph P n,d to the integers Z, where the graph P n,d is the discrete segment {0, 1, . . . , n} with edges between vertices of different

doi:10.1214/ejp.v19-3060
fatcat:kwvgcokdlfdkdgxscb2ws4lwzq