Walks on graphs and lattices – effective bounds and applications
From MaRDI portal
Publication:5191077
DOI10.1515/FORUM.2009.034zbMath1231.20065arXivmath/0703533MaRDI QIDQ5191077
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
finite groups; probability distributions; random elements; undirected graphs; symmetric generating sets; products of elements; numbers of walks
60G50: Sums of independent random variables; random walks
60C05: Combinatorial probability
05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
20P05: Probabilistic methods in group theory
05C81: Random walks on graphs
Related Items
Random subgroups of linear groups are free., Growth in free groups (and other stories) -- twelve years later, Quasimorphisms, random walks, and transient subsets in countable groups, How to pick a random integer matrix? (and other questions)
Cites Work