Indexed metadata

A Model for Random Random-Walks on Finite Groups

ANDREW S. GREENHALGH

Source record

Source: Crossref

Published: Mar 1, 1997

DOI: 10.1017/s096354839600257x

Open original source ↗

Source abstract

A model for a random random-walk on a finite group is developed where the group elements that generate the random-walk are chosen uniformly and with replacement from the group. When the group is the d-cube Z d 2 , it is shown that if the generating set is size k then as d → ∞ with k − d → ∞ almost all of the random-walks converge to uniform in k ln ( k /( k − d ))/4+ρ k steps, where ρ is any constant satisfying ρ > −ln (ln 2)/4.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.