Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
  1. Home
  2. Probability Theory and Related Fields
  3. Article
Walks on generating sets of Abelian groups
Download PDF
Download PDF
  • Published: September 1996

Walks on generating sets of Abelian groups

  • P. Diaconis1 &
  • L. Saloff-Coste2 

Probability Theory and Related Fields volume 105, pages 393–421 (1996)Cite this article

  • 194 Accesses

  • 28 Citations

  • Metrics details

Summary

This paper studies a challenge problem posed by D. Aldous which also arises in algorithms for manipulating finite groups. The main tools used are comparison of two Markov chains on different but related state spaces and logarithmic Sobolev inequalities. As usual, the comparison argument involves some combinatorics of path.

Download to read the full article text

Working on a manuscript?

Avoid the common mistakes

References

  1. Babai L. (1986):On the length of subgroup chains in the symmetric group Comm. Alg. 14, 1729–1736

    Google Scholar 

  2. Cameron P., Solomon R., Turull A. (1989):Chains of subgroups in symmetric groups. Jour. Alg. 127, 340–352

    Google Scholar 

  3. Celler F., Leedham-Green C., Murray S., Niemeyer A., O'Brien E. (1995):Generating random elements of finite group. Commun. Algebra23, 4931–4948

    Google Scholar 

  4. Davidov G., Sarnack P.: Forthcoming book

  5. Diaconis P. (1982):Applications of non-commutative Fourier analysis to probability problems. Springer L.N.M. 1362, 51–100

    Google Scholar 

  6. Diaconis P. (1986):Group representations in probability and statistics. IMS, Hayward

    Google Scholar 

  7. Diaconis P., Graham R.L. (1995):On graphs and group Preprint, Dept. of Math. Harvard University

  8. Diaconis P., Saloff-Coste L. (1993):Comparison theorems for reversible Markov chains. Ann. Appl. Prob. 3, 696–730

    Google Scholar 

  9. Diaconis P., Saloff-Coste L. (1993):Comparison techniques for random walk on finite groups. Ann. Prob. 21, 2131–2156

    Google Scholar 

  10. Diaconis P., Saloff-Coste L. (1992):Logarithmic Sobolevs inequalities and finite Markov chains. Preprint

  11. Diaconis P., Saloff-Coste L. (1995):Walls on generating sets of groups

  12. Diaconis P. and Stroock D. (1991):Geometric bounds for eigenvalues for Markov chains. Ann. Appl. Prob. 1, 36–61

    Google Scholar 

  13. Finkelstein L., Kantor W. (1993):Groups and computation. Amer. Math. Soc. Providence

    Google Scholar 

  14. Gluck D. (1994):Random walk and character ratios on finite groups of Lie type. Adv. Math. To appear

  15. Gross L. (1976):Logarithmic Sobolev inequalities. Am. J. Math. 1061–1083

  16. Hildebrand M. (1992):Generating random elements in SL n (Fq)by random transvections. J. Alg. Combinatorics 1, 133–150

    Google Scholar 

  17. Holley R., Stoock D. (1987):Logarithmic Sobolev inequalities and stochastic Ising models. J. Stat. Phys. 46, 1159–1194

    Google Scholar 

  18. Lubotzky A. Phillips R., Sarnack P. (1988):Ramanujan graphs. Combinatorica, 8, 261–277

    Google Scholar 

  19. Magaard K. (1995): Personal communication

  20. Sinclair A. (1993):Algorithms for random generation and counting: a Markov chain approach. Birkhäuser, Boston

    Google Scholar 

  21. Suzuki M. (1982):Group theory I., Springer, New York

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Harvard University, 02138, Cambridge, MA, USA

    P. Diaconis

  2. CNRS, Université Paul Sabatier, Statistique et Probabilités, F-31062, Toulouse Cedex, France

    L. Saloff-Coste

Authors
  1. P. Diaconis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. L. Saloff-Coste
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research partially supported by NATO grant CRG 950686

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Diaconis, P., Saloff-Coste, L. Walks on generating sets of Abelian groups. Probab. Th. Rel. Fields 105, 393–421 (1996). https://doi.org/10.1007/BF01192214

Download citation

  • Received: 28 July 1995

  • Revised: 18 January 1996

  • Issue Date: September 1996

  • DOI: https://doi.org/10.1007/BF01192214

Share this article

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Mathematics Subject Classification (1991)

  • 60J10
  • 60K35
Download PDF

Working on a manuscript?

Avoid the common mistakes

Advertisement

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature