Compact orbit spaces in Hilbert spaces and limits of edge-colouring models

DOI10.1016/J.EJC.2015.07.013MaRDI QIDQ896083zbMATHOpenAlexFDO

Authors Guus Regts, Alexander Schrijver

Publication date 11 December 2015

Published in European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

spin modelsvertex models

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Abstract: Let $G$ be a group of orthogonal transformations of a real Hilbert space $H$. Let $R$ and $W$ be bounded $G$-stable subsets of $H$. Let $|.{|}_R$ be the seminorm on $H$ defined by $|x{|}_R:=su{p}_{rinR}|langler,xangle|$ for $xinH$. We show that if $W$ is weakly compact and the orbit space $R^k/G$ is compact for each $kinoN$, then the orbit space $W/G$ is compact when $W$ is equiped with the norm topology induced by $|.{|}_R$. As a consequence we derive the existence of limits of edge-colouring models which answers a question posed by Lov'asz. It forms the edge-colouring counterpart of the graph limits of Lov'asz and Szegedy, which can be seen as limits of vertex-colouring models. In the terminology of de la Harpe and Jones, vertex- and edge-colouring models are called `spin models' and `vertex models' respectively.

Recommendations

• Orbit spaces of Hilbert manifolds
• Orbit spaces of the hyperspace of a graph which are Hilbert cubes
• The automorphism group of a graphon
• On orbit closures of groups.
• Hilbert spaces with generic groups of automorphisms

Cites work

• scientific article; zbMATH DE number 3232606 (Why is no real title available?)
• scientific article; zbMATH DE number 3320716 (Why is no real title available?)
• Characterizing partition functions of the vertex model
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• Edge coloring models and reflection positivity
• Graph Invariants in the Edge Model
• Graph invariants related to statistical mechanical models: Examples and problems
• Large networks and graph limits
• Limits of dense graph sequences
• Measure-preserving maps on \(\mathbb R^n\)
• Quick approximation to matrices and applications
• Szemerédi's lemma for the analyst
• Tensor decomposition and approximation schemes for constraint satisfaction problems

Cited in

(4)

• Cut distance identifying graphon parameters over weak* limits
• From flip processes to dynamical systems on graphons
• Relating the cut distance and the weak* topology for graphons
• Cut-norm and entropy minimization over \(\text{weak}^{\ast}\) limits

This page was built for publication: Compact orbit spaces in Hilbert spaces and limits of edge-colouring models

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