[Paper Review] Multicoloured Random Graphs: Constructions and Symmetry

Sam Tarzi|arXiv (Cornell University)|Jun 30, 2014

Advanced Graph Theory Research391 references3 citations

TL;DR

This monograph investigates multicoloured random graphs, particularly the triality graph Rt (a 3-edge-coloured countably infinite random graph), and their associated symmetry groups. It constructs Rt via algebraic and combinatorial methods, establishes its universality and homogeneity, and reveals that its automorphism group supports a triality structure linked to the exceptional group PΩ⁺(8,R), distinguishing it from the two-coloured random graph R. The key contribution is the identification of a novel group action with triality, extending classical random graph theory into higher symmetry domains with connections to lattices, rings, and Moufang loops.

ABSTRACT

This is a research monograph on constructions of and group actions on countable homogeneous graphs, concentrating particularly on the simple random graph and its edge-coloured variants. We study various aspects of the graphs, but the emphasis is on understanding those groups that are supported by these graphs together with links with other structures such as lattices, topologies and filters, rings and algebras, metric spaces, sets and models, Moufang loops and monoids. The large amount of background material included serves as an introduction to the theories that are used to produce the new results. The large number of references should help in making this a resource for anyone interested in beginning research in this or allied fields.

Motivation & Objective

• To construct and characterize the 3-edge-coloured random graph Rt, generalizing the classical random graph R to multiple edge colours.
• To investigate the structure of automorphism groups acting on multicoloured random graphs, especially the emergence of triality in Rt.
• To establish connections between Rt and advanced algebraic structures such as Moufang loops, exceptional groups, and polynomial algebras.
• To explore the role of filters, topologies, and metric spaces in the context of random graphs and their symmetries.
• To extend classical results on the random graph R to m-coloured variants Rm,ω and analyze their group-theoretic and model-theoretic properties.

Proposed method

• Uses Fraïssé's theorem and the one-point extension property to construct Rt as the unique countable, homogeneous, universal structure for 3-coloured graphs.
• Applies switching operations (ξ) and finitary permutations (Sm,n) to generate automorphism groups of multicoloured graphs.
• Employs group presentations and loop-theoretic constructions to realize Rt as a homogeneous Cayley object over a Moufang loop.
• Utilizes ring-theoretic constructions, including polynomial algebras and isomorphisms with Cameron-Glynn algebras, to analyze symmetries.
• Applies topological tools such as Stone–Čech compactification and neighbourhood filters to study automorphism groups and ultrafilters.
• Introduces the concept of 'finitary switching groups' and analyzes their parity equivalence and primitivity.

Experimental results

Research questions

• RQ1 What is the structure of the automorphism group of the 3-edge-coloured random graph Rt, and how does it differ from that of the two-coloured random graph R?
• RQ2 Can the triality symmetry observed in Rt be realized algebraically via group actions or loop constructions?
• RQ3 How do the ring and algebraic structures associated with Rm,ω differ for m ≥ 3 compared to m = 2?
• RQ4 What is the role of filters and topologies in characterizing automorphism groups of random graphs?
• RQ5 To what extent can the random graph R and its variants be realized as Cayley objects over algebraic structures like Moufang loops or lattices?

Key findings

• The triality graph Rt is uniquely characterized as the countable, homogeneous, universal 3-edge-coloured graph, satisfying the one-point extension property.
• The automorphism group of Rt supports a triality structure isomorphic to the outer automorphism group of PΩ⁺(8,R), a key distinction from the two-coloured case.
• The switching group Sm,n for m-coloured graphs is shown to be closed under finitary permutations and admits a presentation via elementary switchings.
• A split extension of Aut(Rt) is constructed, revealing a non-trivial action of the triality group on the graph’s symmetry structure.
• The paper establishes a ring isomorphism between the polynomial algebra of Rt and the Cameron-Glynn algebra, linking graph theory to invariant theory.
• The construction of Rt as a homogeneous Cayley object over a Moufang loop provides a new realization of the graph with deep algebraic symmetry.