Random walk with long-range constraints

DOI10.1214/EJP.V19-3060MaRDI QIDQ2248619zbMATH OpenFDO

Authors Yinon Spinka, Ron Peled

Publication date 27 June 2014

Published in Electronic Journal of Probability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1310.1583

zbMATH Keywords

constrained random walkdelocalization transitionhomomorphism height functionlocalizationrandom graph homomorphism

Mathematics Subject Classification ID

Asymptotic enumeration (05A16) Combinatorial probability (60C05) Geometric probability and stochastic geometry (60D05) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Phase transitions (general) in equilibrium statistical mechanics (82B26) Critical phenomena in equilibrium statistical mechanics (82B27) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)

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 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. 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. 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.

Recommendations

• A combinatorial approach to a model of constrained random walkers
• Random walk on the random connection model
• Random walk on the range of random walk
• High-dimensional Lipschitz functions are typically flat
• Height function delocalisation on cubic planar graphs

Cited in

(8)

• Strongly correlated random interacting processes. Abstracts from the workshop held January 28 -- February 3, 2018
• Height function delocalisation on cubic planar graphs
• Rigidity of proper colorings of \(\mathbb{Z}^d \)
• A combinatorial approach to a model of constrained random walkers
• A restricted random walk model
• The Blume-Emery-Griffiths model on the FAD point and on the AD line
• Height function localisation on trees
• Lipschitz functions on weak expanders

This page was built for publication: Random walk with long-range constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2248619)