Walks on graphs and lattices – effective bounds and applications

DOI10.1515/FORUM.2009.034zbMath1231.20065arXivmath/0703533MaRDI QIDQ5191077

Igor Rivin

Publication date: 28 July 2009

Published in: Forum Mathematicum (Search for Journal in Brave)

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

zbMATH Keywords

finite groupsprobability distributionsrandom elementsundirected graphssymmetric generating setsproducts of elementsnumbers of walks

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Combinatorial probability (60C05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Probabilistic methods in group theory (20P05) Random walks on graphs (05C81)

Related Items (4)

Random subgroups of linear groups are free. ⋮ Quasimorphisms, random walks, and transient subsets in countable groups ⋮ Growth in free groups (and other stories) -- twelve years later ⋮ How to pick a random integer matrix? (and other questions)

Cites Work

• Property (T) and Kazhdan constants for discrete groups

This page was built for publication: Walks on graphs and lattices – effective bounds and applications