• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

The Boundary A-(T)-menability of the Space of Finite Bounded Degree Graphs

Businhani Biz, Leonardo 23 November 2021 (has links)
Following the mechanisms, where the coarse geometric properties of a space with bounded geometry can induce properties on the related coarse (boundary) groupoid and vice versa, we prove that a sequence of bounded degree graphs being hyperfinite is equivalent to the equivalence relation induced by the coarse boundary groupoid associated to this sequence being hyperfinite. Even more, we introduce a coarse and weaker notion of Property A in a sequence of graphs, called Property A on average, that also turns out to be equivalent to the hyperfiniteness of a sequence of bounded degree graphs. Furthermore, we show that if the coarse boundary groupoid is topologically a-T-menable, then the related sequence of bounded degree graphs is asymptotically coarsely embeddable into a Hilbert space. In the measurable case, we also have the asymptotic coarse embeddability of the sequence of graphs after discarding small subgraphs along the sequence and looking at this new sequence of graphs with the induced length metric of original graph. Afterwards those result are applicable to sofic groups. When we take the sequence of graphs to be a sofic approximation of an amenable discrete finitely generated sofic group, we know that this sequence is hyperfinte, has property A on average and property almost-A. If the group is a-T-menable then the sequence of graphs is weakly asymptotically coarsely embeddable into a Hilbert space.

Page generated in 0.218 seconds