Random walk on a randomly oriented honeycomb lattice

MaRDI QIDQ5235949zbMATH OpenFDO

Authors

Publication date 14 October 2019

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

zbMATH Keywords

directed graphhexagonal latticehoneycomb latticeMarkov chainrandom environmentrandom graphrecurrence criteria

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Processes in random environments (60K37)

Abstract: We study the recurrence behaviour of random walks on partially oriented honeycomb lattices. The vertical edges are undirected while the orientation of the horizontal edges is random: depending on their distribution, we prove a.s. transience in some cases, and a.s. recurrence in other ones. The results extend those obtained for the partially oriented square grid lattices (Campanino and Petritis (2003), Campanino and Petritis (2014)).

Recommendations

• scientific article; zbMATH DE number 2051869
• Random walk on the randomly-oriented Manhattan lattice
• Random walks on quasi-one-dimensional lattices
• Random walk on half-plane half-comb structure
• Random walk on a disordered directed Bethe lattice
• A deterministic walk on the randomly oriented Manhattan lattice
• Random self-avoiding walks on one-dimensional lattices

Cited in

(3)

• scientific article; zbMATH DE number 2051869 (Why is no real title available?)
• Type transition of simple random walks on randomly directed regular lattices
• Transient random walk in \({\mathbb Z}^2\) with stationary orientations

This page was built for publication: Random walk on a randomly oriented honeycomb lattice

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