Random orderings and unique ergodicity of automorphism groups

From MaRDI portal
Publication:479519

DOI10.4171/JEMS/483zbMATH Open1304.22027arXiv1208.2389MaRDI QIDQ479519FDOQ479519


Authors: Omer Angel, Alexander S. Kechris, Russell Lyons Edit this on Wikidata


Publication date: 5 December 2014

Published in: Journal of the European Mathematical Society (JEMS) (Search for Journal in Brave)

Abstract: 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 and Weiss's example of the group of all permutations of the integers. We also contrast these results to those for certain special classes of graphs and metric spaces in which such random orderings can be found that are not uniform.


Full work available at URL: https://arxiv.org/abs/1208.2389




Recommendations




Cites Work


Cited In (24)





This page was built for publication: Random orderings and unique ergodicity of automorphism groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q479519)