University of Cambridge > > Discrete Analysis Seminar > Volume growth, random walks and electric resistance in vertex-transitive graphs

Volume growth, random walks and electric resistance in vertex-transitive graphs

Add to your list(s) Download to your calendar using vCal

  • UserMatthew Tointon (University of Cambridge)
  • ClockWednesday 13 November 2019, 13:45-14:45
  • HouseMR5, CMS.

If you have a question about this talk, please contact Thomas Bloom.

An infinite connected graph G is called recurrent if, with probability 1, the simple random walk on G it eventually returns to its starting point. Varopoulos famously showed that a Cayley graph has a recurrent random walk if and only if the underlying group has a finite-index subgroup isomorphic to Z or Z^2. A key step is to show that a recurrent Cayley graph has at most quadratic volume growth – that is, the cardinality of the ball of radius n about the identity grows at most quadratically in n. In this talk I will describe some finitary versions of these statements. In particular, I will present an analogue of Varopoulos’s theorem for finite Cayley graphs, resolving a conjecture of Benjamini and Kozma. This is joint work with Romain Tessera.

This talk is part of the Discrete Analysis Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2019, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity