Walks on Graphs and Lattices – Effective Bounds and Applications

  title={Walks on Graphs and Lattices – Effective Bounds and Applications},
  author={Igor Rivin},
A. We continue the investigations started in [7, 8]. We consider the following situation: G is a finite directed graph, where to each vertex of G is assigned an element of a finite group Γ. We consider all walks of length N on G, starting from vi and ending at v j. To each such walk w we assign the element of Γ equal to the product of the elements along the walk. The set of all walks of length N from vi to v j thus induces a probability distribution FN,i, j on Γ. In [7] we give necessary… CONTINUE READING


Publications referenced by this paper.
Showing 1-10 of 12 references

An introduction to sieve methods and their applications, volume 66 of London Mathematical Society Student Texts

  • Alina Carmen Cojocaru, M. Ram Murty
  • 2006
1 Excerpt

Property (T) and Kazhdan constants for discrete groups

  • A. Żuk
  • Geom. Funct. Anal.,
  • 2003

Explicit Kazhdan constants for representations of semisimple and arithmetic groups

  • Yehuda Shalom
  • Ann. Inst. Fourier (Grenoble),
  • 2000

Representations of finite and compact groups, volume 10 of Graduate Studies in Mathematics

  • Barry Simon
  • American Mathematical Society,
  • 1996
2 Excerpts

Discrete groups, expanding graphs and invariant measures, volume 125 of Progress in Mathematics

  • Alexander Lubotzky
  • Birkhäuser Verlag, Basel,
  • 1994

Représentations linéaires des groupes finis

  • Jean-Pierre Serre
  • Hermann, Paris, revised edition,
  • 1978
1 Excerpt

Similar Papers

Loading similar papers…