Finite graphs and amenability (Q1760172): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2043660965 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1204.0449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kesten's theorem for invariant random subgroups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Processes on unimodular random networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every minor-closed property of sparse graphs is testable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse graphs: Metrics and random models / rank
 
Normal rank
Property / cites work
 
Property / cites work: On limits of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(L^{2}\)-spectral invariants and convergent sequences of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameter testing in bounded degree graphs of subexponential growth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4800032 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Graph Partitions for Approximation and Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amenability, hyperfiniteness, and isoperimetric inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hausdorff dimension of the harmonic measure on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics in orbit equivalence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Borel chromatic numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every property of hyperfinite graphs is testable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy and isomorphism theorems for actions of amenable groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyperfinite graph limits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak equivalence and non-classifiability of measure preserving actions / rank
 
Normal rank

Latest revision as of 21:24, 5 July 2024

scientific article
Language Label Description Also known as
English
Finite graphs and amenability
scientific article

    Statements

    Finite graphs and amenability (English)
    0 references
    0 references
    13 November 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    amenability
    0 references
    hyperfiniteness
    0 references
    graphings
    0 references
    0 references
    0 references