Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

2 results

  • Unimodular random one-ended planar graphs are sofic

  • Part of
  • Ádám Timár
  • Journal:
    Combinatorics, Probability and Computing / Volume 32 / Issue 6 / November 2023
    Published online by Cambridge University Press:
    09 June 2023, pp. 851-858
    • Article
      • You have access
    • PDF
    • HTML
    • Export citation

  • 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.

  • 13 - Kirchberg’s conjecture

  • Gilles Pisier, Texas A & M University
  • Book:
    Tensor Products of <I>C</I>*-Algebras and Operator Spaces
    Published online:
    10 February 2020
    Print publication:
    27 February 2020, pp 280-290

  • 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.