English
Related papers

Related papers: Unimodular random graphs with Property (T) have co…

200 papers

Motivated in part by combinatorial applications to certain sum-product phenomena, we introduce unimodular graphs over finite fields and, more generally, over finite valuation rings. We compute the spectrum of the unimodular graphs, by using…

Combinatorics · Mathematics 2023-11-17 Bogdan Nica

We classify the countable ultrahomogeneous 2-vertex-colored graphs in which the color classes are imprimitive, i.e., up to complementation they form disjoint unions of cliques. This generalizes work by Jenkinson, Lockett and Truss as well…

Combinatorics · Mathematics 2023-06-16 Sofia Brenner , Irene Heinrich

We introduces the umodules, a generalisation of the notion of graph module. The theory we develop captures among others undirected graphs, tournaments, digraphs, and $2-$structures. We show that, under some axioms, a unique decomposition…

Data Structures and Algorithms · Computer Science 2009-09-29 Binh-Minh Bui-Xuan , Michel Habib , Vincent Limouzy , Fabien De Montgolfier

The directions of an infinite graph $G$ are a tangle-like description of its ends: they are choice functions that choose compatibly for all finite vertex sets $X\subseteq V(G)$ a component of $G-X$. Although every direction is induced by a…

Combinatorics · Mathematics 2021-01-19 Jan Kurkofka , Ruben Melcher

Let $G_1$ be a semisimple real Lie group and $G_2$ another locally compact second countable unimodular group. We prove that $G_1 \times G_2$ has fixed price one if $G_1$ has higher rank, or if $G_1$ has rank one and $G_2$ is a $p$-adic…

Group Theory · Mathematics 2023-07-24 Sam Mellick

In this paper, we prove that any graph product of finitely many groups, all satisfying the Haagerup property (or Gromov's a-T-menability) also satisfies Haagerup property.

Group Theory · Mathematics 2026-02-04 Shubhabrata Das , Partha Sarathi Ghosh

We give a short geometric proof of a result of Soardi & Woess and Salvatori that a quasitransitive graph is amenable if and only if its automorphism group is amenable and unimodular. We also strengthen one direction of that result by…

Group Theory · Mathematics 2023-06-16 Romain Tessera , Matthew Tointon

We consider the following three properties for countable discrete groups $\Gamma$: (1) $\Gamma$ has an infinite subgroup with relative property (T), (2) the group von Neumann algebra $L\Gamma$ has a diffuse von Neumann subalgebra with…

Group Theory · Mathematics 2018-02-27 Ionut Chifan , Adrian Ioana

Given a hereditary graph property $\mathcal{P}$, consider distributions of random orderings of vertices of graphs $G\in\mathcal{P}$ that are preserved under isomorphisms and under taking induced subgraphs. We show that for many properties…

Probability · Mathematics 2015-06-11 Paul Balister , Béla Bollobás , Svante Janson

The classical zero-one law for first-order logic on random graphs says that for any first-order sentence $\phi$ in the theory of graphs, as n approaches infinity, the probability that the random graph G(n, p) satisfies $\phi$ approaches…

Combinatorics · Mathematics 2009-04-17 Phokion G. Kolaitis , Swastik Kopparty

We investigate unimodular random networks. Our motivations include their characterization via reversibility of an associated random walk and their similarities to unimodular quasi-transitive graphs. We extend various theorems concerning…

Probability · Mathematics 2020-05-20 David Aldous , Russell Lyons

For compact Hausdorff admissible right topological (CHART) group $G$, we prove $w(G)=\pi\chi(G)$. This equality is well known for compact topological groups. This implies the criteria for the metrizability of CHART groups: if $G$ is…

Group Theory · Mathematics 2023-01-16 Evgenii Reznichenko

The law of a finite graph is a probability measure induced by the orbits of the graph under its automorphism group. Every law satisfies the intrinsic mass transport principle, which is also known as unimodularity. We discuss the convergence…

Combinatorics · Mathematics 2011-03-30 Igor Artemenko

We show that Property $\mathrm{(TTT)}$ is an obstruction to weak amenability with Cowling--Haagerup constant $1$. More precisely, if $G$ is a countable group and $H$ is an infinite subgroup of $G$ such that the pair $(G,H)$ has relative…

Group Theory · Mathematics 2024-10-10 Ignacio Vergara

We give a partial solution to a long-standing open problem in the theory of quantum groups, namely we prove that all finite-dimensional representations of a wide class of locally compact quantum groups factor through matrix quantum groups…

Operator Algebras · Mathematics 2019-01-28 Biswarup Das , Matthew Daws , Pekka Salmi

Chudnovsky, Kim, Oum, and Seymour recently established that any prime graph contains one of a short list of induced prime subgraphs [1]. In the present paper we reprove their theorem using many of the same ideas, but with the key…

Logic · Mathematics 2015-11-10 M. Malliaris , C. Terry

An additive hereditary graph property is a set of graphs, closed under isomorphism and under taking subgraphs and disjoint unions. Let ${\cal P}_1, >..., {\cal P}_n$ be additive hereditary graph properties. A graph $G$ has property $({\cal…

Combinatorics · Mathematics 2007-05-23 Alastair Farrugia , R. Bruce Richter

We prove that, for the free algebra over a sufficiently rich operad, a large subgroup of its group of tame automorphisms has Kazhdan's property (T). We deduce that there exists a group with property (T) that maps onto large powers of…

Group Theory · Mathematics 2023-08-29 Laurent Bartholdi , Martin Kassabov

We study a uniform, quantitative form of the amenability-hyperfiniteness paradigm for bounded-degree Borel graphs generating countable Borel equivalence relations. We introduce \emph{uniform Borel amenability} and prove that it is…

Dynamical Systems · Mathematics 2026-05-19 Gábor Elek , Ádám Timár

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…

Group Theory · Mathematics 2011-09-20 Miklós Abért , Gábor Elek