17 citations · 48 across the 22 of their papers we have counts for
Showing math.NTShow all
3 papers · 1 filter
math.NT2007★ 1 cited
Walks on graphs and lattices -- effective bounds and applications
Igor Rivin
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 Gamma. We consider all walks of length N on G,…
math.NT2007★ 2 cited
Walks on groups, counting reducible matrices, polynomials, and surface and free group automorphisms
Igor Rivin
We prove sharp limit theorems on random walks on graphs with values in finite groups. We then apply these results (together with some elementary algebraic geometry, number theory,…
math.NT2002
The moment zeta function and applications
Igor Rivin
Motivated by a probabilistic analysis of a simple game (itself inspired by a problem in computational learning theory) we introduce the \emph{moment zeta function} of a probability…