Related papers: Uniform Borel Amenability

We prove the a.e. nonamenability of locally finite quasi-pmp Borel graphs whose every component admits at least three nonvanishing ends with respect to the underlying Radon--Nikodym cocycle. We witness their nonamenability by constructing…

We extend a result of Lyons (2016) from fractional tiling of finite graphs to a version for infinite random graphs. The most general result is as follows. Let $\bf P$ be a unimodular probability measure on rooted networks $(G, o)$ with…

We give a model-theoretic account for several results regarding sequences of random variables appearing in Berkes & Rosenthal \cite{Berkes-Rosenthal:AlmostExchangeableSequences}. In order to do this, {itemize} We study and compare three…

In this paper we consider bounded operators on infinite graphs, in particular Cayley graphs of amenable groups. The operators satisfy an equivariance condition which is formulated in terms of a colouring of the vertex set of the underlying…

We prove that Connes' Embedding Conjecture holds for the von Neumann algebras of sofic groups, that is sofic groups are hyperlinear. Hence we provide some new examples of hyperlinearity. We also show that the Determinant Conjecture holds…

We introduce a new invariant of Borel reducibility, namely the notion of thickness; this associates to every sentence $\Phi$ of $\mathcal{L}_{\omega_1 \omega}$ and to every cardinal $\lambda$, the thickness $\tau(\Phi, \lambda)$ of $\Phi$…

In his work on the Farrell-Jones Conjecture, Arthur Bartels introduced the concept of a "finitely $\mathcal{F}$-amenable" group action, where $\mathcal{F}$ is a family of subgroups. We show how a finitely $\mathcal{F}$-amenable action of a…

Associated to a family of $G$-$\ast$-endomorphisms on a $G$-C*-algebra $A$ satisfying certain minimality conditions, we give a $G$-C*-correspondence $\mathcal{E}$ over $A$ whose Cuntz--Pimsner algebra $\mathcal{O}_\mathcal{E}$ is simple.…

Inference on vertex-aligned graphs is of wide theoretical and practical importance.There are, however, few flexible and tractable statistical models for correlated graphs, and even fewer comprehensive approaches to parametric inference on…

This paper studies higher index theory for a random sequence of bounded degree, finite graphs with diameter tending to infinity. We show that in a natural model for such random sequences the following hold almost surely: the coarse…

Asymptotic separation index is a parameter that measures how easily a Borel graph can be approximated by its subgraphs with finite components. In contrast to the more classical notion of hyperfiniteness, asymptotic separation index is…

Measurement incompatibility--the impossibility of jointly measuring certain quantum observables--is a fundamental resource for quantum information processing. We develop a graph-theoretic framework for quantifying this resource for large…

Given a discrete and countable inverse semigroup $S$ one can study, in analogy to the group case, its geometric aspects. In particular, we can equip $S$ with a natural metric, given by the path metric in the disjoint union of its…

We study continuous bounded cohomology of totally disconnected locally compact groups with coefficients in a non-Archimedean valued field $K$. To capture the features of classical amenability that induce the vanishing of real bounded…

Given a finitely generated amenable group we consider ergodic random Schr\"odinger operators on a Cayley graph with random potentials and random boundary conditions. We show that the normalised eigenvalue counting functions of finite volume…

We study amenability of affine algebras (based on the notion of almost-invariant finite-dimensional subspace), and apply it to algebras associated with finitely generated groups. We show that a group G is amenable if and only if its group…

It is well known due to Hahn and Mazurkiewicz that every Peano continuum is a continuous image of the unit interval. We prove that an assignment, which takes as an input a Peano continuum and produces as an output a continuous mapping whose…

We propose a wide class of preferential attachment models of random graphs, generalizing previous approaches. Graphs described by these models obey the power-law degree distribution, with the exponent that can be controlled in the models.…

Incomplete U-statistics have been proposed to accelerate computation. They use only a subset of the subsamples required for kernel evaluations by complete U-statistics. This paper gives a finite sample bound in the style of Bernstein's…

We prove measurable analogues of Whitney's classical theorems on weak isomorphisms of finite graphs. In the setting of locally finite graphings, we introduce a notion of weak isomorphism as an edge-measure-preserving Borel bijection that…