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

We prove that if a unimodular random rooted graph is recurrent, the number of ends of its uniform spanning tree is almost surely equal to the number of ends of the graph. Together with previous results in the transient case, this completely…

We prove a homological stability theorem for families of discrete groups (e.g. mapping class groups, automorphism groups of free groups, braid groups) with coefficients in a sequence of irreducible algebraic representations of arithmetic…

We study Property (T) in the $\Gamma(n,k,d)$ model of random groups: as $k$ tends to infinity this gives the Gromov density model, introduced in [Gro93]. We provide bounds for Property (T) in the $k$-angular model of random groups, i.e. the…

Augustine et al. [DISC 2022] initiated the study of distributed graph algorithms in the presence of Byzantine nodes in the congested clique model. In this model, there is a set $B$ of Byzantine nodes, where $|B|$ is less than a third of the…

We develop a family of simple rank one theories built over quite arbitrary sequences of finite hypergraphs. (This extends an idea from the recent proof that Keisler's order has continuum many classes, however, the construction does not…

Given two graphs $G$ and $H$, assume that $\mathscr{C}=\{C_1,C_2,\ldots, C_q\}$ is a clique cover of $G$ and $U$ is a subset of $V(H)$. We introduce a new graph operation called the clique cover product, denoted by $G^{\mathscr{C}}\star…

We prove that every (possibly infinite) graph of degree at most $d$ has a 4-dependent random proper $4^{d(d+1)/2}$-coloring, and one can construct it as a finitary factor of iid. For unimodular transitive (or unimodular random) graphs we…

With any self-similar action of a finitely generated group $G$ of automorphisms of a regular rooted tree $T$ can be naturally associated an infinite sequence of finite graphs $\{\Gamma_n\}_{n\geq 1}$, where $\Gamma_n$ is the Schreier graph…

Let $G$ be a discrete group with property (T). It is a standard fact that, in a unitary representation of $G$ on a Hilbert space $\mathcal{H}$, almost invariant vectors are close to invariant vectors, in a quantitative way. We begin by…

We show that every countable group with infinite FC-center has the Schmidt property, i.e., admits a free, ergodic, measure-preserving action on a standard probability space such that the full group of the associated orbit equivalence…

We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…

Barbieri recently showed that the finite graphs realising any given finite automorphism group have unbounded genus, answering a question of Cornwell et al. In this note we give a short proof of a stronger result: they have unbounded clique…

We study the automorphism groups of countable homogeneous directed graphs (and some additional homogeneous structures) from the point of view of topological dynamics. We determine precisely which of these automorphism groups are amenable…

We prove several theorems relating amenability of groups in various categories (discrete, definable, topological, automorphism group) to model-theoretic invariants (quotients by connected components, Lascar Galois group, G-compactness,…

Given a self-similar groupoid action $(G,E)$ on a finite directed graph, we prove some properties of the corresponding ample groupoid of germs $\mathcal G(G,E)$. We study the analogue of the Higman-Thompson group associated to $(G,E)$ using…

We show that the only random orderings of finite graphs that are invariant under isomorphism and induced subgraph are the uniform random orderings. We show how this implies the unique ergodicity of the automorphism group of the random…

The usual way to investigate the statistical properties of finitely generated subgroups of free groups, and of finite presentations of groups, is based on the so-called word-based distribution: subgroups are generated (finite presentations…

Let $G$ be a $q$-regular bipartite graph with bipartition $(U,V)$. It was proved by Lu, Wang, and Yan in 2020 that $G$ has a spanning subgraph $H$ such that each vertex of $U$ has degree 1 in $H$, and each vertex of $V$ has degree distinct…

Around 2008, Schramm conjectured that the critical probabilities for Bernoulli bond percolation satisfy the following continuity property: If $(G_n)_{n\geq 1}$ is a sequence of transitive graphs converging locally to a transitive graph $G$…

Given a finite simple undirected graph $G$, let $T_1(G)$ denote the subset of vertices of $G$ such that every vertex of $T_1(G)$ belongs to at least one subgraph isomorphic to a graph obtained by connecting a single vertex to two vertices…