2–3 Paths in a Lattice Graph: Random Walks
I. M. Erusalimskyi
Southern Federal University, Rostov-on-Don
A lattice graph with 2–3 reachability constraints is considered. The graph's vertices are the points with integer nonnegative coordinates in the plane. Each vertex has two outgoing edges, one entering its immediate right neighbor and the other entering its immediate upper neighbor. The admissible paths for 2–3 reachability are those in which the numbers of edges in all but the last inclusion-maximal straight-line segments are divisible by $2$ for horizontal segments and by $3$ for vertical segments. A formula for the number of 2–3 paths from a vertex to a vertex is obtained. A random walk process on the 2–3 paths in the lattice graph is considered. It is proved that this process can locally be reduced to a Markov process on subgraphs determined by the type of the initial vertex. Formulas for the probabilities of vertex-to-vertex transitions along 2–3 paths are obtained.
digraph, lattice graph, random walk, transition probability, vertex reachability.
PDF file (490 kB)
First page: PDF file
Mathematical Notes, 2018, 104:3, 395–403
I. M. Erusalimskyi, “2–3 Paths in a Lattice Graph: Random Walks”, Mat. Zametki, 104:3 (2018), 396–406; Math. Notes, 104:3 (2018), 395–403
Citation in format AMSBIB
\paper 2--3 Paths in a Lattice Graph: Random Walks
\jour Mat. Zametki
\jour Math. Notes
Citing articles on Google Scholar:
Related articles on Google Scholar:
|Number of views:|