Related papers: Sofic actions on graphs
The automorphism group of the composition of graphs $G \circ H$ contains the wreath product $Aut(H) \wr Aut(G)$ of the automorphism groups of the corresponding graphs. The classical problem considered by Sabidussi and Hemminger was under…
We discuss a general framework of monotone skew-product semiflows under a connected group action. In a prior work, a compact connected group $G$-action has been considered on a strongly monotone skew-product semiflow. Here we relax the…
We consider the class of semi-transitively orientable graphs, which is a much larger class of graphs compared to transitively orientable graphs, in other words, comparability graphs. Ever since the concept of a semi-transitive orientation…
We consider the amenability of groupoids $G$ equipped with a group valued cocycle $c:G\to Q$ with amenable kernel $c^{-1}(e)$. We prove a general result which implies, in particular, that $G$ is amenable whenever $Q$ is amenable and if…
We obtain an effective enumeration of the family of finitely generated groups admitting a faithful, properly discontinuous action on some 2-manifold contained in the sphere. This is achieved by introducing a type of group presentation…
In this paper we continue Prasma's homotopical group theory program by considering homotopy normal maps in arbitrary $\infty$-topoi. We show that maps of group objects equipped with normality data, in Prasma's sense, are algebras for a…
We introduce and study certain topological spaces associated with connected rooted graphs. These spaces reflect combinatorial and order theoretic properties of the underlying graph and relate in the case of hyperbolic graphs to Gromov's…
The notion of smoothness was introduced originally in the context of step systems on connected graphs. Smoothness turns out to be a very general property of metrics defined by a five-point condition. Restricted to graphs, it is closely…
We prove that if two topologically free and entropy regular actions of countable sofic groups on compact metrizable spaces are continuously orbit equivalent, and each group either (i) contains a w-normal amenable subgroup which is neither…
These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…
Some basic notions and results in Topological Dynamics are extended to continuous groupoid actions in topological spaces. We focus mainly on recurrence properties. Besides results that are analogous to the classical case of group actions,…
Answering some queries of Weiss, we prove that the free product and amenable extensions of sofic groups are sofic as well, and give an example of a finitely generated sofic group that is not residually amenable.
The main purpose of this paper is to strengthen our understanding of sofic mean dimension of two typical classes of sofic group actions. First, we study finite group actions. We prove that sofic mean dimension of any amenable group action…
Algorithmic graph theory has thoroughly analyzed how, given a network describing constraints between various nodes, groups can be formed among these so that the resulting configuration optimizes a \emph{global} metric. In contrast, for…
We give a simple and unified proof showing that the unrestricted wreath product of a weakly sofic, sofic, linear sofic, or hyperlinear group by an amenable group is weakly sofic, sofic, linear sofic, or hyperlinear, respectively. By means…
In this paper we investigate graphs that admit a group acting arc-transitively such that the local action is semiprimitive with a regular normal nilpotent subgroup. This type of semiprimitive group is a generalisation of an affine group. We…
We study analytic properties of graph product of finite groups with a hyperbolic defining graph. This is done by studying dynamics on the Bowditch compactification of the extension graph, or the crossing graph, of graph product. In…
Graph aggregation is the process of computing a single output graph that constitutes a good compromise between several input graphs, each provided by a different source. One needs to perform graph aggregation in a wide variety of…
A recently fertile strand of research in Group Theory is developing non-abelian analogues of classical combinatorial results for arithmetic Cayley graphs, describing properties such as growth, expansion, mixing, diameter, etc. We consider…
We propose a novel construction of finite hypergraphs and relational structures that is based on reduced products with Cayley graphs of groupoids. To this end we construct groupoids whose Cayley graphs have large girth not just in the usual…