To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
This chapter is devoted to the study of the space of bounded harmonic functions and the Liouville property. We start with the entropic criterion for the Liouville property. We then investigate the relationship of the Liouville property with amenability, speed of the random walk, and coupling of exit measures.The central example of lamplighter groups is studied.
This chapter provides a full elementary proof of Gromov’s theorem, which states that a finitely generated group has polynomial growth if and only if it is virtually nilpotent. The proof proceeds along the ideas laid forth by Ozawa, using the existence of a harmonic cocycle. Gromov’s theorem is then used to classify all recurrent groups. Also, consequences of harmonic cocycle to diffusivitiy of the walk are shown.
This chapter is devoted to proving the Milnor–Wolf theorem, which states that a finitely generated solvable group has polynomial growth if and only if it is actually virtually nilpotent.
In this chapter all the basic notation and concepts are introduced.The notions of nilpotent, solvable, free, linear, finitely generated, and finitely presented groups are defined and examples are provided.Spaces of bounded and Lipschitz harmonic functions are defined, as well as harmonic functions of polynomial growths. Group actions are discussed and convolutions over abstract groups are defined.
Here, we dive deeper into the realm of reversible Markov chains, via the perspective of network theory. The notions of conductance and resistance are defined, as well as voltage and current, and the corresponding mathematical theory.The Laplacian and Green function are defined and their relation to harmonic functions explained. The chapter culminates with a proof (using network theory) that recurrence and transience are essentially group properties: these properties remain invariant when changing between different reasonable random walks on the same group (specifically, symmetric and adapted with finite second moment).
We study the noise sensitivity of the minimum spanning tree (MST) of the $n$-vertex complete graph when edges are assigned independent random weights. It is known that when the graph distance is rescaled by $n^{1/3}$ and vertices are given a uniform measure, the MST converges in distribution in the Gromov–Hausdorff–Prokhorov (GHP) topology. We prove that if the weight of each edge is resampled independently with probability $\varepsilon \gg n^{-1/3}$, then the pair of rescaled minimum spanning trees – before and after the noise – converges in distribution to independent random spaces. Conversely, if $\varepsilon \ll n^{-1/3}$, the GHP distance between the rescaled trees goes to $0$ in probability. This implies the noise sensitivity and stability for every property of the MST that corresponds to a continuity set of the random limit. The noise threshold of $n^{-1/3}$ coincides with the critical window of the Erdős-Rényi random graphs. In fact, these results follow from an analog theorem we prove regarding the minimum spanning forest of critical random graphs.
This chapter dives into the theory of (discrete time) martingales.The optional stopping theorem and the martingale convergence theorem are proved.These are used to provide some initial results regarding random walks on groups and bounded harmonic functions. Specifically, the random walk on the integer line is shown to be recurrent. Also, it is shown that the space of bounded harmonic functions is either just the constant functions or has infinite dimension.
The Choquet–Deny theorem states that any random walk on a nilpotent group is Liouville. This theorem is presented and proved. We then present a recent result from 2018 by Frisch, Hartman, Tamuz, and Vahidi-Ferdowski, that these are basically the only such examples.
In this chapter we start applying the tools developed in Part I to study random walks.The notion of amenable groups is defined, and Kesten’s criterion for amenable groups is proved. We then move to define the notion of isopermitric dimension. Inequalities relating the volume growth of a group to the isoperimetric dimension and to the decay of the heat kernel are proved.