Related papers: Uniform Borel Amenability

We give a combinatorial characterization of amenability of monomial algebras and prove the existence of monomial Folner sequences, answering a question due to Ceccherini-Silberstein and Samet-Vaillant. We then use our characterization to…

We investigate when a Borel graph admits a (Borel or measurable) orientation with outdegree bounded by $k$ for various cardinals $k$. We show that for a p.m.p. graph $G$, a measurable orientation can be found when $k$ is larger than the…

We relativise the Thomassen--Woess definition of accessibility in graphs, defining what it means for a graph to be accessible relative to a peripheral system. In the case of locally finite, quasi-transitive graphs, we characterise relative…

Working within the framework of free actions of countable amenable groups on compact metrizable spaces, we show that the small boundary property is equivalent to a density version of almost finiteness, which we call almost finiteness in…

We study groups which satisfy Gardner's equidecomposition conjecture for uniformly distributed sets. We prove that an amenable group has this property if and only if it does not admit $(\mathbb{Z}/2\mathbb{Z}) *(\mathbb{Z}/2\mathbb{Z})$ as…

We introduce the notions of approximate Connes-amenability and approximate strong Connes-amenability for dual Banach algebras. Then we characterize these two types of algebras in terms of approximate normal virtual diagonals and approximate…

We introduce the matching measure of a finite graph as the uniform distribution on the roots of the matching polynomial of the graph. We analyze the asymptotic behavior of the matching measure for graph sequences with bounded degree. A…

Louveau and Rosendal [5] have shown that the relation of bi-embeddability for countable graphs as well as for many other natural classes of countable structures is complete under Borel reducibility for analytic equivalence relations. This…

Given a countable transitive model of set theory and a partial order contained in it, there is a natural countable Borel equivalence relation on generic filters over the model; two are equivalent if they yield the same generic extension. We…

The original definition of amenability given by von Neumann in the highly non-constructive terms of means was later recast by Day using approximately invariant probability measures. Moreover, as it was conjectured by Furstenberg and proved…

We study the relationship between hyperfiniteness and problems in Borel graph combinatorics by adapting game-theoretic techniques introduced by Marks to the hyperfinite setting. We compute the possible Borel chromatic numbers and edge…

In this article, we introduce and explore the notion of topological amenability in the broad setting of (locally compact) semihypergroups. We acquire several stationary, ergodic and Banach algebraic characterizations of the same in terms of…

We characterize Borel line graphs in terms of 10 forbidden induced subgraphs, namely the 9 finite graphs from the classical result of Beineke together with a 10th infinite graph associated to the equivalence relation $\mathbb{E}_0$ on the…

We analyze the dichotomy amenable/paradoxical in the context of (discrete, countable, unital) semigroups and corresponding semigroup rings. We consider also F{\o}lner's type characterizations of amenability and give an example of a…

Building on recent results regarding symmetric probabilistic constructions of countable structures, we provide a method for constructing probability measures, concentrated on certain classes of countably infinite structures, that are…

A topological group $G$ is extremely amenable if every continuous action of $G$ on a compact space has a fixed point. Using the concentration of measure techniques developed by Gromov and Milman, we prove that the group of automorphisms of…

In this paper we investigate the extent to which the Lov\'asz Local Lemma (an important tool in probabilistic combinatorics) can be adapted for the measurable setting. In most applications, the Lov\'asz Local Lemma is used to produce a…

In this paper we show that for every congruent monotileable amenable group $G$ and for every metrizable Choquet simplex $K$, there exists a minimal $G$-subshift, which is free on a full measure set, whose set of invariant probability…

We give a cohomological criterion for certain decomposition of Borel graphs, which is an analog of Dunwoody's work on accessibility of groups. As an application, we prove that a Borel graph $(X,G)$ with uniformly bounded degrees of…

In this thesis, the main objects of study are probability measures on the isomorphism classes of countable, connected rooted graphs. An important class of such measures is formed by unimodular measures, which satisfy a certain equation,…