Graph lattice: random walk and combinatorial identities

DOI10.1007/S40590-016-0115-9zbMath1348.05198OpenAlexW2350694384MaRDI QIDQ334733

I. M. Erusalimskiy

Publication date: 1 November 2016

Published in: Boletín de la Sociedad Matemática Mexicana. Third Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40590-016-0115-9

zbMATH Keywords

random walksdirected graphcombinatorial identityPascal's triangleprobability of transitionreachability of vertices

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Infinite graphs (05C63) Random walks on graphs (05C81)

Related Items (2)

2-3 paths in a lattice graph: random walks ⋮ Combinatorial Identities with Binomial Coefficients

Cites Work

• Discrete Calculus
• Unnamed Item

This page was built for publication: Graph lattice: random walk and combinatorial identities