Prescribed graphon symmetries and flavors of rigidity

From MaRDI portal
Publication:6403013

arXiv2206.11997MaRDI QIDQ6403013FDOQ6403013


Authors: Alexandru Chirvasitu Edit this on Wikidata


Publication date: 23 June 2022

Abstract: We prove that an arbitrary compact metrizable group can be realized as the automorphism group of a graphing; this is a continuous analogue to Frucht's theorem recovering arbitrary finite groups are automorphism groups of finite graphs. The paper also contains a number of results the persistence of transitivity of a compact-group action upon passing to a limit of graphons. Call a compact group mathbbG graphon-rigid if, whenever it acts transitively on each member Gamman of a convergent sequence of graphons, it also acts transitively on the limit limnGamma. We show that for a compact Lie group mathbbG graphon rigidity is equivalent to the identity component mathbbG0 being semisimple; as a partial converse to a result of Lov'{a}sz and Szegedy, this is also equivalent to weak randomness: the property that the group have only finitely many irreducible representations in each dimension. Similarly, call a compact group mathbbG image-rigid if for every compact Lie group mathbbH the images of morphisms mathbbGomathbbH form a closed set (of closed subgroups, in the natural topology). We prove that graphon rigidity implies image rigidity for compact groups that are either connected or profinite, and the two conditions are equivalent (and also equivalent to being torsion) for profinite abelian groups.













This page was built for publication: Prescribed graphon symmetries and flavors of rigidity

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