Search

We prove that if a unimodular random graph is almost surely planar and has finite expected degree, then it has a combinatorial embedding into the plane which is also unimodular. This implies the claim in the title immediately by a theorem of Angel, Hutchcroft, Nachmias and Ray [2]. Our unimodular embedding also implies that all the dichotomy results of [2] about unimodular maps extend in the one-ended case to unimodular random planar graphs.

Summary

Here we formulate the Connes embedding problem, whether any tracial probability space embeds in an ultraproduct of matricial ones. We also briefly describe the so-called hyperfinite factor R, with which one can reformulate the question as asking for an embedding in an ultrapower of R. Since the Connes problem is open even for the tracial probability spaces associated to discrete groups, this leads us to describe several related interesting classes of infinite groupssuch as residually finite, hyperlinear and sofic groups. We also discuss the so-called matrix models in terms of which the Connes problem can be naturally reformulated. Lastly, we give a quite transparent characterization of nuclear von Neumann algebras, which shows that there are very few of them.

Search Results

Refine search

Refine search

Actions for selected content:

2 results

Unimodular random one-ended planar graphs are sofic

13 - Kirchberg’s conjecture

Summary

Search Results

Refine search

Refine search

Actions for selected content:

Save Search

2 results

Unimodular random one-ended planar graphs are sofic

13 - Kirchberg’s conjecture

Summary