Related papers: Sofic actions on graphs
We investigate Cayley graphs of graph products by showing that graph products with vertex groups that have isomorphic Cayley graphs yield isomorphic Cayley graphs.
Given sofic approximations for countable, discrete groups $G,H$, we construct a sofic approximation for their wreath product $G\wr H$.
In this paper, we study several finite approximation properties of topological full groups of group actions on the Cantor set such that free points are dense. Firstly, we establish that for such a distal action $\alpha$ of a countable…
In this note we extend the concept of topological stability from homeomorphisms to group actions on compact metric spaces, and prove that if an action of a finitely generated group is expansive and has the pseudo-orbit tracing property then…
Autostackability for finitely presented groups is a topological property of the Cayley graph combined with formal language theoretic restrictions, that implies solvability of the word problem. The class of autostackable groups is known to…
A connected graph is called \emph{geodetic} if there is a unique geodesic between each pair of vertices. In this paper we prove that if a finitely generated group admits a Cayley graph which is geodetic, then the group must be virtually…
We give a simpler proof using automata theory of a recent result of Kapovich, Weidmann and Myasnikov according to which so-called benign graphs of groups preserve decidability of the generalized word problem. These include graphs of groups…
From the point of view of discrete geometry, the class of locally finite transitive graphs is a wide and important one. The subclass of Cayley graphs is of particular interest, as testifies the development of geometric group theory. Recall…
Sofic groups generalise both residually finite and amenable groups, and the concept is central to many important results and conjectures in measured group theory. We introduce a topological notion of a sofic boundary attached to a given…
Dynamic graph theory is a novel, growing area that deals with graphs that change over time and is of great utility in modelling modern wireless, mobile and dynamic environments. As a graph evolves, possibly arbitrarily, it is challenging to…
In a previous paper the authors developed an operator-algebraic approach to Lewis Bowen's sofic measure entropy that yields invariants for actions of countable sofic groups by homeomorphisms on a compact metrizable space and by…
We survey the known group properties that a sequence of finite groups or group actions needs to satisfy to admit subsets of bounded cardinality producing expander Cayley or Schreier graphs. We prove that an infinite amenable group and…
We prove that for a measure preserving action of a sofic group with positive sofic entropy, the set of points with finite stabilizer have positive measure. This extends results of Weiss and Seward for amenable groups and free groups,…
We study dynamical and computational properties of the set of bi-infinite self-avoiding walks on Cayley graphs, as well as ways to compute, approximate and bound their connective constant. To do this, we introduce the skeleton $X_{G,S}$ of…
Coalition formation over graphs is a well studied class of games whose players are vertices and feasible coalitions must be connected subgraphs. In this setting, the existence and computation of equilibria, under various notions of…
Social learning algorithms provide models for the formation of opinions over social networks resulting from local reasoning and peer-to-peer exchanges. Interactions occur over an underlying graph topology, which describes the flow of…
As a main result of this paper we give conditions under which the generalized $X$-join of Cayley graphs is a Cayley graph. In particular, we show that $X$-join of isomorphic Cayley graphs is a Cayley grpah. To do this, new properties for a…
We study graph products of groups from the viewpoint of measured group theory. We first establish a full measure equivalence classification of graph products of countably infinite groups over finite simple graphs with no transvection and no…
In this paper we introduce a product-like operation that generalizes the construction of generalized Sierpi\'nski graphs. Let $G,H$ be graphs and let $f: V(G) \to V(H)$ be a function. Then the Sierpi\'nski product of $G$ and $H$ with…
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…