Graph lattice: random walk and combinatorial identities

DOI10.1007/S40590-016-0115-9zbMATH Open1348.05198OpenAlexW2350694384MaRDI QIDQ334733FDOQ334733

Authors: 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

Recommendations

• scientific article; zbMATH DE number 2151249
• scientific article; zbMATH DE number 4070938
• Publication:4723770
• Graph homomorphisms through random walks
• scientific article; zbMATH DE number 4197088
• Random walks on the random graph
• scientific article; zbMATH DE number 4007384
• Random walks on graphs: ideas, techniques and results
• Random walks on complete multipartite graphs
• Adjacency and transition matrices related to random walks on graphs

zbMATH Keywords

random walkscombinatorial identitydirected graphPascal's triangleprobability of transitionreachability of vertices

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Discrete calculus. Applied analysis on graphs for computational science

Cited In (3)

• 2-3 paths in a lattice graph: random walks
• Title not available (Why is that?)
• Combinatorial Identities with Binomial Coefficients

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

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