Factor of IID Percolation on Trees (Q5298168): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1410.3745 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial approach to the interpolation method and scaling limits in sparse random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform spanning forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Independence Ratio of Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramanujan graphings and correlation decay in local algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On large‐girth regular graphs and random processes on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decycling numbers of random regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A measure-conjugacy invariant for free group actions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Invariant Gaussian processes and independent sets on regular graphs of large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Invariant random perfect matchings in Cayley graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Borel oracles. An analytical approach to constant-time algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the independence and chromatic numbers of random regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Greedy Algorithms for Independent Sets and Matchings in Regular Graphs: Exact Results and Finite Girth Corrections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits of local algorithms over sparse random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence ratio and random eigenvectors in transitive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits of locally-globally convergent graph sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced Forests in Regular Graphs with Large Girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of regular graphs with large girth via local algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large independent sets in regular graphs of large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factors of IID on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings as IID factors on non-amenable groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability on Trees and Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Percolation with small clusters on random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local algorithms for independent sets are half-optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the independence number of triangle-free graphs. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of pure states in mean field models for spin glasses / rank
 
Normal rank

Latest revision as of 02:43, 13 July 2024

scientific article; zbMATH DE number 6663068
Language Label Description Also known as
English
Factor of IID Percolation on Trees
scientific article; zbMATH DE number 6663068

    Statements

    Factor of IID Percolation on Trees (English)
    0 references
    0 references
    13 December 2016
    0 references
    factor of iid
    0 references
    induced forest
    0 references
    percolation
    0 references
    random regular graphs
    0 references
    local algorithms
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references