Electronic Journal of Probability

Random walk with long-range constraints

Yinon Spinka and Ron Peled

Full-text: Open access

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 $\mathbb{Z}$, where the graph $P_{n,d}$ is the discrete segment $\{0,1,\ldots, n\}$ with edges between vertices of different parity whose distance is at most $2d+1$. Such a graph homomorphism can be viewed as a height function whose values change by exactly one along edges of the graph $P_{n,d}$. We also consider a similarly defined model on the discrete torus.<br /><br />Benjamini, Yadin and Yehudayoff conjectured that this model undergoes a phase transition from a delocalized to a localized phase when $d$ grows beyond a threshold $c\log n$. We establish this conjecture with the precise threshold $\log_2 n$. Our results provide information on the typical range and variance of the height function for every given pair of $n$ and $d$, including the critical case when $d-\log_2 n$ tends to a constant.<br /><br />In addition, we identify the local limit of the model, when $d$ is constant and $n$ tends to infinity, as an explicitly defined Markov chain.

Article information

Source
Electron. J. Probab., Volume 19 (2014), paper no. 52, 54 pp.

Dates
Accepted: 23 June 2014
First available in Project Euclid: 4 June 2016

Permanent link to this document
https://projecteuclid.org/euclid.ejp/1465065694

Digital Object Identifier
doi:10.1214/EJP.v19-3060

Mathematical Reviews number (MathSciNet)
MR3227061

Zentralblatt MATH identifier
1294.82019

Subjects
Primary: 82B41: Random walks, random surfaces, lattice animals, etc. [See also 60G50, 82C41]
Secondary: 60C05: Combinatorial probability 82B20: Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs 82B26: Phase transitions (general) 60D05: Geometric probability and stochastic geometry [See also 52A22, 53C65] 05A16: Asymptotic enumeration 60K35: Interacting random processes; statistical mechanics type models; percolation theory [See also 82B43, 82C43]

Keywords
Random walk random graph homomorphism phase transition Lipschitz function

Rights
This work is licensed under a Creative Commons Attribution 3.0 License.

Citation

Spinka, Yinon; Peled, Ron. Random walk with long-range constraints. Electron. J. Probab. 19 (2014), paper no. 52, 54 pp. doi:10.1214/EJP.v19-3060. https://projecteuclid.org/euclid.ejp/1465065694


Export citation

References

  • Benjamini, Itai; Häggström, Olle; Mossel, Elchanan. On random graph homomorphisms into ${\bf Z}$. J. Combin. Theory Ser. B 78 (2000), no. 1, 86–114.
  • Benjamini, Itai; Peres, Yuval. Markov chains indexed by trees. Ann. Probab. 22 (1994), no. 1, 219–243.
  • Benjamini, Itai; Peres, Yuval. Tree-indexed random walks on groups and first passage percolation. Probab. Theory Related Fields 98 (1994), no. 1, 91–112.
  • Benjamini, Itai; Yadin, Ariel; Yehudayoff, Amir. Random graph-homomorphisms and logarithmic degree. Electron. J. Probab. 12 (2007), no. 32, 926–950.
  • Brascamp, Herm Jan; Lieb, Elliot H.; Lebowitz, Joel L. The statistical mechanics of anharmonic lattices. Proceedings of the 40th Session of the International Statistical Institute (Warsaw, 1975), Vol. 1. Invited papers. Bull. Inst. Internat. Statist. 46 (1975), no. 1, 393–404 (1976).
  • Erdős, Paul. On a lemma of Littlewood and Offord, Bull. Amer. Math. Soc. 51 (1945), 898–902.
  • Galvin, David. On homomorphisms from the Hamming cube to ${\bf Z}$. Israel J. Math. 138 (2003), 189–213.
  • Kahn, Jeff. Range of cube-indexed random walk. Israel J. Math. 124 (2001), 189–201.
  • Levin, David A.; Peres, Yuval; Wilmer, Elizabeth L. Markov chains and mixing times. With a chapter by James G. Propp and David B. Wilson. American Mathematical Society, Providence, RI, 2009. xviii+371 pp. ISBN: 978-0-8218-4739-8
  • Peled, Ron. High-dimensional Lipschitz functions are typically flat, arXiv preprint arXiv:1005.4636, To appear in Annals of Probability (2010).
  • Peled, Ron; Samotij, Wojciech; Yehudayoff, Amir. Lipschitz functions on expanders are typically flat. Combin. Probab. Comput. 22 (2013), no. 4, 566–591.
  • Propp, James Gary; Wilson, David Bruce. Exact sampling with coupled Markov chains and applications to statistical mechanics. Proceedings of the Seventh International Conference on Random Structures and Algorithms (Atlanta, GA, 1995). Random Structures Algorithms 9 (1996), no. 1-2, 223–252.