Random ergodic theorems with universally representative sequences
We show that the only random orderings of finite graphs that are invariant under isomorphism and induced subgraph are the uniform random orderings. We show how this implies the unique ergodicity of the automorphism group of the random graph. We give similar theorems for other structures, including, for example, metric spaces. These give the first examples of uniquely ergodic groups, other than compact groups and extremely amenable groups, after Glasner andWeiss’s example of the group of all permutations...
We show that for every ergodic flow, given any factor σ-algebra ℱ, there exists a σ-algebra which is relatively perfect with respect to ℱ. Using this result and Ornstein's isomorphism theorem for flows, we give a functorial definition of the entropy of flows.
Using very original methods from operator algebras, Sorin Popa has shown that the orbit structure of the Bernoulli action of a property (T) group, completely remembers the group and the action. This information is even essentially contained in the crossed product von Neumann algebra. This is the first von Neumann strong rigidity theorem in the literature. The same methods allow Popa to obtain II factors with prescribed countable fundamental group.