Recent variants and applications of the arithmetic large sieve

The "large sieve" was invented by Linnik in order to attack problems involving the distribution of integers subject to certain constraints modulo primes, for which earlier methods of sieve theory were not suitable. Recently, the arithmetic large sieve inequality has been found to be capable of much wider application, and has been used to obtain results involving objects not usually considered as related to sieve theory. A form of the general sieve setting will be presented, together with sample applications; those may involve arithmetic properties of random walks on discrete groups, zeta functions over finite fields, modular forms, or even random groups.