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

A theorem of Glasner from 1979 shows that if $A \subset \mathbb{T} = \mathbb{R}/\mathbb{Z}$ is infinite then for each $\epsilon > 0$ there exists an integer $n$ such that $nA$ is $\epsilon$-dense and Berend-Peres later showed that in fact…

There are a variety of ways to associate directed or undirected graphs to a group. It may be interesting to investigate the relations between the structure of these graphs and characterizing certain properties of the group in terms of some…

Every homomorphism from finite index subgroups of a universal lattices to mapping class groups of orientable surfaces (possibly with punctures), or to outer automorphism groups of finitely generated nonabelian free groups must have finite…

Let $i_t(G)$ be the number of independent sets of size $t$ in a graph $G$. Alavi, Erd\H{o}s, Malde and Schwenk made the conjecture that if $G$ is a tree then the independent set sequence $\{i_t(G)\}_{t\geq 0}$ of $G$ is unimodal; Levit and…

Let p be a real number with 1<p and different from 2. We study Property (T_lp) for a second countable locally compact group G. Property (T_lp) is a weak version of Kazhdan's Property (T), defined in terms of the orthogonal representations…

Inspired by a concept in comparative genomics, we investigate properties of randomly chosen members of G_1(m,n,t), the set of bipartite graphs with $m$ left vertices, n right vertices, t edges, and each vertex of degree at least one. We…

We introduce a new class of countably infinite random geometric graphs, whose vertices are points in a metric space, and vertices are adjacent independently with probability p if the metric distance between the vertices is below a given…

We prove that every free group G with infinitely many generators admits a Hausdorff group topology T with the following property: for every T-open neighbourhood U of the identity of G, each element g in G can be represented as a product…

We consider hereditary classes of graphs equipped with a total order. We provide multiple equivalent characterisations of those classes which have bounded twin-width. In particular, we prove a grid theorem for classes of ordered graphs…

A graph property (i.e., a set of graphs) is induced-hereditary or additive if it is closed under taking induced-subgraphs or disjoint unions. If $\cP$ and $\cQ$ are properties, the product $\cP \circ \cQ$ consists of all graphs $G$ for…

Utilizing the notion of property (T) we construct new examples of quantum group norms on the polynomial algebra of a compact quantum group, and provide criteria ensuring that these are not equal to neither the minimal nor the maximal norm.…

We prove that the Loop O(1) model, a well-known graphical expansion of the Ising model, is a factor of i.i.d. on unimodular random rooted graphs under various conditions, including in the presence of a non-negative external field. As an…

We give a characterization of geometric property (T) for a coarse disjoint union of finite graphs with bounded degree using the idea of noncommutative real algebraic geometry. In the proof, we define a $*$-subalgebra $I_u[X]$ of real…

In 1993, Lubotzky and Weiss conjectured that if a compact group admits two finitely generated dense subgroups, one of which is amenable and the other has Kazhdan's property (T), then it would be finite. This conjecture was resolved in the…

Consider the Erd\H{o}s-Renyi random graph on n vertices where each edge is present independently with probability c/n, with c>0 fixed. For large n, a typical random graph locally behaves like a Galton-Watson tree with Poisson offspring…

We investigate unitarisability of groups by looking at actions on the cone of positive invertible operators of a Hilbert space. This way, we give a geometric prove to a result by Gilles Pisier on the existence of some universal constants…

Erd\H{o}s and R\'{e}nyi showed the paradoxical result that there is a unique (and highly symmetric) countably infinite random graph. This graph, and its automorphism group, form the subject of the present survey.

This paper studies infinite graphs produced from a natural unfolding operation applied to finite graphs. Graphs produced via such operations are of finite degree and automatic over the unary alphabet (that is, they can be described by…

We show that for infinite planar unimodular random rooted maps, many global geometric and probabilistic properties are equivalent, and are determined by a natural, local notion of average curvature. This dichotomy includes properties…

We show that for a sequence of random graphs Brouwer's conjecture holds true with probability tending to one as the number of vertices tends to infinity. Surprisingly, it was found that a similar statement holds true for weighted graphs…