Related papers: Weak amenability is stable under graph products
A (discrete) group is called amenable whenever there exists a finitely additive right invariant probablity measure on it. For Thompson's group $F$ the problem whether it is amenable is a long-standing open question. We consider presentation…
The Haagerup property for locally compact groups is generalised to the context of locally compact quantum groups, with several equivalent characterisations in terms of the unitary representations and positive-definite functions established.…
This paper includes a series of structural results for von Neumann algebras arising from measure preserving actions by product groups on probability spaces. Expanding upon the methods used earlier by the first two authors \cite{CS}, we…
This paper demonstrates the uniformly finite homology developed by Block and Weinberger and its relationship to amenable spaces via applications to the Cayley graph of Thompson's Group F. In particular, a certain class of subgraph of F is…
A group is self-simulable if all its computable actions admit SFT covers, which means roughly that they can be implemented with finitely many tiling constraints. We prove that a graph product of infinite finitely-generated groups is…
We introduce the notion of Zimmer amenability for actions of discrete quantum groups on von Neumann algebras. We prove generalizations of several fundamental results of the theory in the noncommutative case. In particular, we give a…
We undertake a systematic study of the approximation properties of the topological and measurable versions of the coarse boundary groupoid associated to a sequence of finite graphs of bounded degree. On the topological side, we prove that…
This is Part 2 in a series of papers about the growth of regular partitions in hereditary properties $3$-uniform hypergraphs. The focus of this paper is the notion of weak hypergraph regularity, first developed by Chung, Chung-Graham, and…
Using recent techniques introduced by Jones we prove that a large family of discrete groups and groupoids have the Haagerup property. In particular, we show that if G is a discrete group with the Haagerup property, then the wreath product…
The Cheeger constant of a graph, or equivalently its coboundary expansion, quantifies the expansion of the graph. This notion assumes an implicit choice of a coefficient group, namely, $\mathbb{F}_2$. In this paper, we study Cheeger-type…
The weak $k$-metric dimension of a graph is roughly understood as the cardinality of a smallest set of vertices $S$ of the graph with the property of uniquely recognizing all the vertices of the graph throughout summations of differences of…
Z.-J. Ruan has shown that several amenability conditions are all equivalent in the case of discrete Kac algebras. In this paper, we extend this work to the case of discrete quantum groups. That is, we show that a discrete quantum group,…
We argue that weak containment is an appropriate notion of amenability for inverse semigroups. Given an inverse semigroup $S$ and a homomorphism $\phi$ of $S$ onto a group $G$, we show, under an assumption on $\ker(\phi)$, that $S$ has weak…
Graph products of monoids provide a common framework for free products and direct products. Trace monoids are graph products of finitely generated free monoids. We investigate the interaction of certain finitary conditions with graph…
We study actions of countable discrete groups which are amenable in the sense that there exists a mean on X which is invariant under the action of G. Assuming that G is nonamenable, we obtain structural results for the stabilizer subgroups…
We consider weakly interacting diffusions on time varying random graphs. The system consists of a large number of nodes in which the state of each node is governed by a diffusion process that is influenced by the neighboring nodes. The…
We undertake a comprehensive study of structural properties of graph products of von Neumann algebras equipped with faithful, normal states, as well as properties of the graph products relative to subalgebras coming from induced subgraphs.…
Dynamic networks are a complex subject. Not only do they inherit the complexity of static networks (as a particular case); they are also sensitive to definitional subtleties that are a frequent source of confusion and incomparability of…
A countable discrete group $\Gamma$ is said to be Frobenius stable if a function from the group that is "almost multiplicative" in the point Frobenius norm topology is "close" to a genuine unitary representation in the same topology. The…
We consider the notion of the graph product of actions of groups $\left\{G_v\right\}$ on a $C^*$-algebra $\mathcal{A}$ and show that under suitable commutativity conditions the graph product action $\bigstar_\Gamma \alpha_v: \bigstar_\Gamma…