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

We generalize the notion of isoperimetric profiles of finitely generated groups to their actions by measuring the boundary of finite subgraphings of the orbit graphing. We prove that like the classical isoperimetric profiles for groups,…

Consider a graph with vertex set S. A word in the alphabet S has the intervening neighbours property if any two occurrences of the same letter are separated by all its graph neighbours. For a Coxeter graph, words represent group elements.…

The random key graph is a random graph naturally associated with the random key predistribution scheme of Eschenauer and Gligor for wireless sensor networks. For this class of random graphs we establish a new version of a conjectured…

We give a simple definition of property T for discrete quantum groups. We prove the basic expected properties: discrete quantum groups with property T are finitely generated and unimodular. Moreover we show that, for "I.C.C." discrete…

We exhibit a topological group $G$ with property (T) acting non-elementarily and continuously on the circle. This group is an uncountable totally disconnected closed subgroup of $\operatorname{Homeo}^+(\mathbf{S}^1)$. It has a large unitary…

The celebrated Erd\H{o}s-Hajnal Conjecture says that in any proper hereditary class of finite graphs we are guaranteed to have a clique or anti-clique of size $n^c$, which is a much better bound than the logarithmic size that is provided by…

We prove that a group acting geometrically on a thick affine building has property (T). A more general criterion for property (T) is given for groups acting on partite complexes.

We prove sharp limit theorems on random walks on graphs with values in finite groups. We then apply these results (together with some elementary algebraic geometry, number theory, and representation theory) to finite quotients of lattices…

We study hereditary properties of the class of countable groups admitting an amenable, transitive and faithful action on a countable set. We consider mainly the case of amalgamated free products, and we show in particular that the double of…

Let $G$ be a graph in which each vertex initially has weight 1. In each step, the unit weight from a vertex $u$ to a neighbouring vertex $v$ can be moved, provided that the weight on $v$ is at least as large as the weight on $u$. The unit…

We develop the theory of algorithmic randomness for the space $A^G$ where $A$ is a finite alphabet and $G$ is a computable amenable group. We give an effective version of the Shannon-McMillan-Breiman theorem in this setting. We also extend…

We show that every non-amenable free product of groups admits free ergodic probability measure preserving actions which have relative property (T) in the sense of S.-Popa \cite[Def. 4.1]{Pop06}. There are uncountably many such actions up to…

The domination polynomial of a graph $G$ is given by $D(G,x)=\sum_{k=0}^{n} d_k(G)x^k$ where $d_k(G)$ records the number of $k$-element dominating sets in $G$. A conjecture of Alikhani and Peng asserts that these polynomials have unimodal…

Elek and Lippner (2010) showed that the convergence of a sequence of bounded-degree graphs implies the existence of a limit for the proportion of vertices covered by a maximum matching. We provide a characterization of the limiting…

We introduce a natural generalization of the Erd\H{o}s-R\'enyi random graph model in which random instances of a fixed motif are added independently. The binomial random motif graph $G(H,n,p)$ is the random (multi)graph obtained by adding…

Let $(\Gamma,\mu)$ be a bipartite graph together with a weight on its vertices. Assume that $\mu$ is an eigenvector for the adjacency matrix of $\Gamma$. Let Aut$(\Gamma, \mu)$ be the automorphism group of the bipartite graph $\Gamma$ that…

We prove that an infinite family of semiprimitive groups are graph-restrictive. This adds to the evidence for the validity of the PSV Conjecture and increases the minimal imprimitive degree for which this conjecture is open to 12. Our…

We construct a countable simple theory which, in Keisler's order, is strictly above the random graph (but "barely so") and also in some sense orthogonal to the building blocks of the recently discovered infinite descending chain. As a…

We study the logical properties of infinite geometric random graphs, introduced by Bonato and Janssen. These are graphs whose vertex set is a dense ``generic'' subset of a metric space, where two vertices are adjacent with probability $p>0$…

A class A of labelled graphs is bridge-addable if for all graphs G in A and all vertices u and v in distinct connected components of G, the graph obtained by adding an edge between u and u is also in A; the class A is monotone if for all G…