Related papers: Sofic actions on graphs

We explore classifiability of crossed products of actions of countable amenable groups on compact, metrizable spaces. It is completely understood when such crossed products are simple, separable, unital, nuclear and satisfy the UCT: these…

A graph $\Ga=(V,E)$ is called a Cayley graph of some group $T$ if the automorphism group $\Aut(\Ga)$ contains a subgroup $T$ which acts on regularly on $V$. If the subgroup $T$ is normal in $\Aut(\Ga)$ then $\Ga$ is called a normal Cayley…

This paper generalizes sofic entropy theory, in both the topological and measure-theory settings, to actions of locally compact groups. We prove invariance under topological and measure conjugacy of these entropies and establish the…

This article explores the novel notion of gyrogroup actions, which is a natural generalization of the usual notion of group actions. As a first step toward the study of gyrogroup actions from the algebraic viewpoint, we prove three…

We describe an underlying right angled building structure of any graph product of buildings. We describe the automorphism group of the graph product of buildings. We show that the notion of generalized graph product of a collection of…

This article lays the foundations for an analogue of geometric group theory that studies actions on graphs by right quasigroups, including racks and quandles. We study markings of graphs that realize racks, and we introduce (di)graph…

As an alternative view to the graph formation models in the statistical physics community, we introduce graph formation models using \textit{network formation} through selfish competition as an approach to modeling graphs with particular…

Let $M_1$ and $M_2$ be two $n$-dimensional smooth manifolds with boundary. Suppose we glue $M_1$ and $M_2$ along some boundary components (which are, therefore, diffeomorphic). Call the result $N.$ If we have a group $G$ acting continuously…

For a transitive infinite connected graph $G$, let $\mu(G)$ be its connective constant. Denote by $\mathbf{\cal G}$ the set of Cayley graphs for finitely generated infinite groups with an infinite-order generator which is independent of…

We show that if $G$ is a finitely generated group hyperbolic relative to a finite collection of subgroups $\mathcal{P}$, then the natural action of $G$ on the geodesic boundary of the associated relative Cayley graph induces a hyperfinite…

Associated to any orthogonal representation of a countable discrete group is an probability measure-preserving action called the Gaussian action. Using the Polish model formalism we developed before, we compute the entropy (in the sense of…

We prove a structure theorem for stable functions on amenable groups, which extends the arithmetic regularity lemma for stable subsets of finite groups. Given a group $G$, a function $f\colon G\to [-1,1]$ is called stable if the binary…

The present paper refers to the knot theory and is devoted to the study of global properties of Gordian graphs of various local moves. In 2005, Gambaudo and Ghys raised the question of the behavior at infinity of the crossing change Gordian…

We show that group actions on many treelike compact spaces are not too complicated dynamically. We first observe that an old argument of Seidler implies that every action of a topological group $G$ on a regular continuum is null and…

Let $\Gamma$ be a simple undirected graph on a finite vertex set and let $A$ be its adjacency matrix. Then $\Gamma$ is {\it singular} if $A$ is singular. The problem of characterising singular graphs is easy to state but very difficult to…

Let $T$ be a tree and $e$ an edge in $T$. If $C$ is a component of $T\setminus e$ and both $C$ and its complement are infinite we say that $C$ is a half-tree. The main result of this paper is that if $G$ is a closed subgroup of the…

We study profinite actions of residually finite groups in terms of weak containment. We show that two strongly ergodic profinite actions of a group are weakly equivalent if and only if they are isomorphic. This allows us to construct…

Current methods of graph signal processing rely heavily on the specific structure of the underlying network: the shift operator and the graph Fourier transform are both derived directly from a specific graph. In many cases, the network is…

We prove that any ergodic nonatomic probability-preserving action of an irreducible lattice in a semisimple group, at least one factor being connected and higher-rank, is essentially free. This generalizes the result of Stuck and Zimmer…

A group action on a metric space is called growth tight if the exponential growth rate of the group with respect to the induced pseudo-metric is strictly greater than that of its quotients. A prototypical example is the action of a free…