---
title: Graph Wreath Products
url: https://www.emergentmind.com/topics/graph-wreath-products
type: topic
---

# Graph Wreath Products

Searching arXiv for recent and foundational papers on graph wreath products and closely related constructions.
to=arxiv_search.search anasiyana  玩北京赛车  เงินฟรี 彩票主管 to=arxiv_search.search  գործում  彩票天天  天天中彩票是不是({
  "query": "\"graph wreath product\" OR \"graph-wreath product\" OR \"wreath product of graphs\"",
  "max_results": 10,
  "sort_by": "relevance"
})
to=arxiv_search.search  天天中彩票中奖 彩网大发快三 山大发 to=arxiv_search.search  գործում ,超碰({
  "query": "\"Conjugacy growth series of some wreath products\" OR 1610.07868 OR \"Graph-wreath products and finiteness conditions\" OR 1407.0302",
  "max_results": 10,
  "sort_by": "relevance"
})
Graph wreath products are constructions in which a graph, a group action on a graph, or a family of graph-indexed copies of another object is assembled into a larger combinatorial or algebraic object. In the literature considered here, the term is used in several related but non-identical senses. In group theory, Kropholler and Martino define the graph-wreath product by
\[
A \wr_{\Gamma} H := A^{\Gamma}\rtimes H,
\]
where \(A^{\Gamma}\) is the graph product of copies of \(A\) indexed by the vertices of an \(H\)-graph \(\Gamma\) [1407.0302]. In graph theory, the wreath product of graphs \(G\) and \(H\) has vertex set \(V_H^{V_G}\times V_G\) and admits “switch” and “walk” edges in the lamplighter sense [1805.08989]. In directed-graph combinatorics, \(G\wr H\) is also used for the lexicographic product on \(V(G)\times V(H)\) [2412.13392]. Quantum-group and operator-algebraic variants extend the same organizing idea to free wreath products and graphs of algebras [2504.13826], [2302.01130].

## 1. Foundational definitions and scope

The graph-theoretic group construction starts from a simple graph \(\Gamma\) with vertex set \(V\) and an action \(H\curvearrowright \Gamma\) by graph automorphisms. The graph product \(A^{\Gamma}\) is obtained from the free product \(*_{v\in V} A_v\), with \(A_v\cong A\), by imposing commuting relations between \(A_v\) and \(A_w\) whenever \(v\) and \(w\) are joined by an edge in \(\Gamma\). The graph-wreath product is then the semidirect product \(A^{\Gamma}\rtimes H\) induced by the \(H\)-action on vertices [1407.0302].

This construction interpolates between several classical cases. If \(\Gamma\) is discrete, then \(A^{\Gamma}\cong *_{v\in V} A\). If \(\Gamma\) is complete, then \(A^{\Gamma}\cong \bigoplus_{v\in V} A\), and \(A\wr_{\Gamma} H\) becomes the restricted permutational wreath product \(A\wr_{\Omega} H\) for the \(H\)-set \(\Omega=V\). When \(A=\mathbb{Z}\), \(A^{\Gamma}\) is the right-angled Artin group on \(\Gamma\); when \(A=\mathbb{Z}/2\mathbb{Z}\), it is the right-angled Coxeter group. Accordingly, graph-wreath products include classical permutational wreath products and semidirect products of right-angled Artin groups by groups of graph automorphisms [1407.0302].

A complementary viewpoint arises from classical wreath products \(G\wr L\) themselves. In the tree-based study of conjugacy growth, elements are interpreted as finitely supported vertex-labellings of the Cayley graph \(\mathrm{Cay}(L,X)\) by elements of \(G\), together with a distinguished cursor position in \(L\). Generators either move the cursor along an edge of the Cayley graph or modify the label at the current vertex. In that sense, ordinary wreath products become graph wreath products over Cayley graphs [1610.07868].

## 2. Geometric models from Cayley graphs

For the restricted wreath product \(G\wr L=\bigoplus_{i\in L}G\rtimes L\), an element \((\eta,b)\) consists of a finitely supported map \(\eta:L\to G\) and a cursor position \(b\in L\). The natural generating set extends the generating sets of \(G\) and \(L\), and the corresponding word metric has a graph-theoretic description: the length of \((\eta,b)\) is the length of a minimal walk in \(\mathrm{Cay}(L,X)\) starting at the identity, visiting every vertex where \(\eta\) is nontrivial, and ending at \(b\), plus the sum of the word lengths of the labels \(\eta(v)\) [1610.07868].

When \(\mathrm{Cay}(L,X)\) is a tree, this walk combinatorics becomes especially rigid. The paper “Conjugacy growth series of some wreath products” studies groups
\[
L=\langle a_1,\dots,a_M,b_1,\dots,b_N\mid b_1^2,\dots,b_N^2\rangle
\]
with tree Cayley graph of degree \(2M+N\), and uses this geometry to compute conjugacy growth in terms of standard and conjugacy growth data for \(G\). The analysis splits conjugacy classes into type \(A\) (cursor of infinite order) and type \(B\) (cursor of finite order), and expresses the type-\(A\) contribution through cyclically reduced words in the tree and Parry’s subtree generating function \(F_T(x,y)\) [1610.07868].

The same graph viewpoint supports other geometric analyses of wreath products. In the Schreier-graph study of property FW, the wreath product \(G\wr_X H\) is examined through an imprimitive action on \(G\times X'\), where \(X'\) is an \(H\)-orbit in \(X\). The corresponding Schreier graph decomposes into leaves \(Y_g=\{g\}\times X'\), each isomorphic to the orbital graph of \(H\curvearrowright X'\), while the distinguished vertices \((g,x_0)\) form a Cayley graph of \(G\). This “graph-of-graphs” structure yields the criterion that a finitely generated wreath product \(G\wr_X H\) has property FW if and only if \(G\) and \(H\) have property FW and \(X\) is finite [2101.03817].

## 3. Graph-level wreath products, matrices, and distances

A distinct graph-theoretic construction takes two finite graphs \(\mathcal{G}_1=(V_1,E_1)\) and \(\mathcal{G}_2=(V_2,E_2)\) and defines their wreath product \(\mathcal{G}_1\wr \mathcal{G}_2\) to have vertex set
\[
V_2^{V_1}\times V_1=\{(f,v)\mid f:V_1\to V_2,\ v\in V_1\}.
\]
Edges come in two types. “Switch” edges change only the lamp state at the current base vertex \(v\), according to adjacency in \(\mathcal{G}_2\); “walk” edges move the lamplighter in \(\mathcal{G}_1\) while leaving the lamp configuration fixed. If \(\mathcal{G}_1\) is \(d_1\)-regular on \(n_1\) vertices and \(\mathcal{G}_2\) is \(d_2\)-regular on \(n_2\) vertices, then \(\mathcal{G}_1\wr \mathcal{G}_2\) has \(n_1n_2^{n_1}\) vertices and is \((d_1+d_2)\)-regular [1507.02609].

This graph wreath product admits an exact matrix model. If \(A_1\) and \(A_2\) are the normalized adjacency matrices of \(\mathcal{G}_1\) and \(\mathcal{G}_2\), then
\[
\left(\frac{d_1}{d_1+d_2}A_1\right)\wr \left(\frac{d_2}{d_1+d_2}A_2\right)
\]
is the normalized adjacency matrix of \(\mathcal{G}_1\wr \mathcal{G}_2\), where the matrix wreath product is defined באמצעות Kronecker products and diagonal projectors \(C_i\). When the second factor is circulant, the spectrum of \(A\wr B\) reduces to the union of spectra of \(m^n\) matrices of order \(n\), yielding explicit spectra for lamplighter walks such as the “Walk or switch” model on \(K_n\) with two lamp colors [1507.02609].

The metric structure of \(\mathcal{G}_1\wr \mathcal{G}_2\) is equally explicit. For \(G=(V_G,E_G)\), \(H=(V_H,E_H)\), \(|V_G|=n\), and vertices
\[
u=(y_1,\dots,y_n)x,\qquad v=(y_1',\dots,y_n')x',
\]
the distance formula is
\[
d_{G\wr H}(u,v)=\sum_{i=1}^n d_H(y_i,y_i')+\rho_{\delta(y,y')}(x,x'),
\]
where \(\delta(y,y')=\{x_i\in V_G:y_i\neq y_i'\}\) and \(\rho_A(u,v)\) is the minimum length of a path in \(G\) from \(u\) to \(v\) visiting every vertex in \(A\). From this one gets
\[
\mathrm{diam}(G\wr H)=n\,\mathrm{diam}(H)+\mathrm{diam}_{Ha}(G),
\]
together with formulas for the antipodal graph, Wiener index, Szeged index, and Zagreb indices of \(G\wr H\) [1805.08989].

A third graph-level convention uses “wreath product” for the lexicographic product of digraphs. Here \(G\wr H\) has vertex set \(V(G)\times V(H)\), and an arc from \((g_1,h_1)\) to \((g_2,h_2)\) exists whenever \((g_1,g_2)\in A(G)\), or \(g_1=g_2\) and \((h_1,h_2)\in A(H)\). In that setting, recent work proves that if \(G\) and \(H\) are Hamiltonian decomposable directed graphs, then most open cases of the conjecture asserting Hamiltonian decomposability of \(G\wr H\) are affirmative; the unresolved exceptions are concentrated in the case where \(G\) is a directed cycle and \(H\) has an odd number of Hamiltonian factors in a decomposition [2412.13392].

## 4. Finiteness conditions and residual finiteness

For \(G=A\wr_{\Gamma} H=A^{\Gamma}\rtimes H\), the basic finiteness properties are controlled by the action of \(H\) on the graph \(\Gamma\) and on its flag complex \(L\). If \(A\) is non-trivial, then \(G\) is finitely generated if and only if \(A\) and \(H\) are finitely generated and \(\Gamma\) has finitely many orbits of vertices. Likewise, \(G\) is finitely presented if and only if \(A\) and \(H\) are finitely presented, \(\Gamma\) has finitely many orbits of vertices and edges, and each vertex stabilizer is finitely generated [1407.0302].

Higher finiteness conditions are formulated in terms of the clique modules \(\mathbb{Z}A_p\), where \(A_p\) denotes the set of \(p\)-simplices of the flag complex. The main sufficient criterion states that \(A\wr_{\Gamma} H\) is of type \(\mathrm{F}_n\) if \(A\) and \(H\) are of type \(\mathrm{F}_n\) and \(\mathbb{Z}A_p\) is of type \(\mathrm{FP}_{n-1-p}\) over \(\mathbb{Z}H\) for \(0\le p\le n-1\). When \(A\) has infinite abelianization, these conditions become necessary and sufficient. When \(H\) is polycyclic-by-finite and \(A\) is non-trivial, the criterion simplifies: \(A\wr_{\Gamma} H\) is of type \(\mathrm{F}_n\) if and only if \(A\) is of type \(\mathrm{F}_n\) and \(H\) acts cocompactly on the \((n-1)\)-skeleton of \(L\) [1407.0302].

Residual finiteness exhibits a similarly graph-sensitive behavior. For a graph \(G=(V,E)\) with an action \(\Gamma\curvearrowright G\) and graph product base \(G(\Delta)\), the graph wreath product \(G(\Delta)\rtimes \Gamma\) is residually finite if and only if \(\Gamma\) and \(\Delta\) are residually finite and two separation conditions hold: one separates vertices from neighbors in finite-index \(\Gamma\)-orbits, and the other separates non-neighbors from the union \(N(v)\cup\{v\}\). In the complete-graph case this recovers Cornulier’s criterion for permutational wreath products; in the empty-graph case it recovers residual finiteness of free products of residually finite groups [2509.11170].

## 5. Growth, Schreier geometry, and automata

The tree-based conjugacy-growth theory of \(G\wr L\) yields explicit generating series. For type-\(A\) conjugacy classes in the case where \(\mathrm{Cay}(L,X)\) is a regular tree of degree \(2M+N\), the contribution is
\[
{}_{(G\wr L,\vec{Y})}^A(z)=
\sum_{r\ge 1}\frac{\phi(r)}{r}\sum_{s\ge 1}
\frac{(2M+N-1)^s+(-1)^s(M+N-1)+M}{s}\,\big(F_E(z^r)\big)^s,
\]
where \(F_E\) is built from Parry’s subtree series \(F_T\) and the growth series of \(G\). The paper proves that, for any such \(L\), the radius of convergence of the conjugacy growth series equals the radius of convergence of the standard growth series. In the lamplighter case \(C_2\wr \mathbb{Z}\), the resulting conjugacy growth series is transcendental over \(\mathbb{Q}(z)\) [1610.07868].

Schreier-graph methods provide another large-scale invariant. For finitely generated groups, property FW is equivalent to all Schreier graphs having at most one end. For a finitely generated wreath product \(G\wr_X H\), this holds exactly when \(G\) and \(H\) have property FW and the \(H\)-set \(X\) is finite. The proof is elementary and explicit: the relevant Schreier graphs decompose into leaves isomorphic to orbital graphs of \(H\), glued along a spine that is a Schreier graph of \(G\) [2101.03817].

Automata-theoretic representations mirror the geometry of the base graph. Wreath products \(G\wr \mathbb{Z}\) admit Cayley automatic representations by finite automata; \(\mathbb{Z}_2\wr F_n\) admits context-free Cayley automatic representations via pushdown automata; and \(\mathbb{Z}_2\wr \mathbb{Z}^2\) admits indexed Cayley automatic representations via nested stack automata. For \(\mathbb{Z}_2\wr \mathbb{Z}\), if \(w\) is the representative of \(g\), then
\[
|w|-1\le |g|\le 3|w|-2.
\]
For \(\mathbb{Z}_2\wr F_n\), the corresponding bounds are
\[
\frac{1}{2n-1}|w|-\frac{1}{2n-1}\le |g|\le 3|w|-2.
\]
These constructions encode the lamplighter on a line, a tree, or a grid, respectively [1511.01630].

## 6. Automorphism groups, lexicographic products, and product actions

Wreath products enter graph theory not only as graph constructions but also as automorphism groups. If \(G\) and \(H\) are colored graphs, the composition \(G\circ H\) has vertex set \(V(G)\times V(H)\), with inter-fibre edges determined by \(G\) and intra-fibre edges determined by \(H\). Its automorphism group always contains
\[
\mathrm{Aut}(H)\wr \mathrm{Aut}(G)
\]
in the natural imprimitive action. Conversely, if a vertex-transitive colored graph has automorphism group \(A\wr B\) in the imprimitive action, then it is isomorphic to a composition \(H_2\circ H_1\) with \(\mathrm{Aut}(H_1)=A\) and \(\mathrm{Aut}(H_2)=B\) [1910.11811].

The product action of wreath products on function sets \(V^W\) is more intricate. Subgroups of \(\mathrm{Sym}(\Gamma)\wr \mathrm{Sym}(\Delta)\) in product action arise as automorphism groups of graph products, Hamming graphs, and codes. A structural theorem shows that, after conjugation by a base-group element, the component induced at a coordinate depends only on the orbit of that coordinate under the induced action on \(\Delta\). If the action on \(\Delta\) is transitive, the subgroup embeds into a smaller wreath product \(G\wr H\), where \(G\) is one coordinate component and \(H\) is the induced coordinate action [1108.3611].

For highly symmetric graphs, this perspective becomes restrictive. If a connected \((G,2)\)-arc-transitive graph has vertex set \(\Gamma^\ell\) and \(G\) is an innately transitive subgroup of \(\mathrm{Sym}(\Gamma)\wr S_\ell\) in product action with non-regular plinth, then either \(G\) is almost simple and the graph is one of exactly two examples—Sylvester’s Double Six graph on \(36=6^2\) vertices, or a graph on \(120^2\) vertices with automorphism group \(\mathrm{Aut}\,Sp(4,4)\)—or the inclusion is of type CD2\(\subset\) with non-simple plinth, a case for which no examples are presently known [1507.01049].

## 7. Quantum and operator-algebraic generalizations

Free wreath products of compact quantum groups extend the same pattern to noncommutative symmetry. The free inhomogeneous wreath product
\[
(\Gamma_1,\dots,\Gamma_m)\wr_* H
\]
is defined from compact matrix quantum groups \(\Gamma_i\) attached to the orbits \(\Omega_i\) of a quantum permutation group \(H\curvearrowright \Omega\). It is constructed from the free product of the \(C(\Gamma_{i,\alpha})\) and \(C(H)\), modulo commutation relations \([g^{(i,\alpha)}_{pq},h_{\alpha\beta}]=0\), and it carries a fundamental representation
\[
f_{\alpha p,\beta q}=
\begin{cases}
h_{\alpha\beta}g^{(i,\alpha)}_{pq}, & \alpha,\beta\in\Omega_i,\\
0, & \text{otherwise}.
\end{cases}
\]
This generalizes both Bichon’s homogeneous free wreath product and the free product. It yields, for example,
\[
\Qut\!\left(\bigsqcup_{i=1}^{n}\bigsqcup_{\alpha=1}^{k_i} X_i^\alpha\right)
\cong
(\Qut(X_1),\dots,\Qut(X_n))\wr_*
\left(\bigast_{i=1}^n S_{k_i}^+\right)
\]
when the \(X_i\) are connected graphs that are pairwise not quantum isomorphic [2504.13826].

The same paper develops a recursive “graph wreath product” description for connected graphs using the block tree of maximal biconnected subgraphs. At block nodes, the quantum automorphism group of the branch below the block is expressed as a free inhomogeneous wreath product of quantum stabilizers of child branches with the quantum automorphism group of the block. At cut vertices, the corresponding stabilizer is a free product of homogeneous free wreath products with quantum symmetric groups. This produces algorithms for forests, block graphs, and outerplanar graphs, under the hypothesis that quantum isomorphism coincides with graph isomorphism in the relevant class [2504.13826].

Operator-algebraic free wreath products admit an equally explicit graph model. For \(G\wr_* S_N^+\), the full and reduced C\(^*\)-algebras and the von Neumann algebra \(L^\infty(G\wr_* S_N^+)\) are realized as fundamental algebras of finite graphs of operator algebras. This yields an explicit Haar-state formula and stability results for exactness, the Haagerup property, hyperlinearity, and K-amenability. Under suitable hypotheses, the associated von Neumann algebra is a full prime factor without Cartan subalgebra, and the same framework gives explicit K-theory computations for quantum reflection groups \(\widehat{\mathbb{Z}_s}\wr_* S_N^+\) [2302.01130].

In this broader landscape, graph wreath products function less as a single definition than as a recurring architecture: graph-indexed families of local objects, coupled by a symmetry group or quantum symmetry, assembled into a global product whose algebraic, geometric, and combinatorial properties can often be computed from the underlying graph.

Source: https://www.emergentmind.com/topics/graph-wreath-products