2-3 paths in a lattice graph: random walks

DOI10.1134/S0001434618090079zbMath1407.05104OpenAlexW2901905893WikidataQ128926978 ScholiaQ128926978MaRDI QIDQ1731476

Ya. M. Erusalimskii

Publication date: 13 March 2019

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0001434618090079

zbMATH Keywords

digraphrandom walktransition probabilitylattice graphvertex reachability

Mathematics Subject Classification ID

Combinatorial probability (60C05) Directed graphs (digraphs), tournaments (05C20) Random walks on graphs (05C81)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dynamic graph models and their properties
• Graph lattice: random walk and combinatorial identities
• Pseudodifferential operators on periodic graphs
• Acoustic diffraction problems on periodic graphs
• On boundary integral operators for diffraction problems on graphs with finitely many exits at infinity
• Diffraction by periodic graphs
• The essential spectrum of Schrödinger operators on lattices
• Essential spectra of difference operators on -periodic graphs

This page was built for publication: 2-3 paths in a lattice graph: random walks