Non-backtracking random walk (Q1942293): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Minimization algorithms and random walk on the d-cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: NON-BACKTRACKING RANDOM WALKS MIX FASTER / rank
 
Normal rank
Property / cites work
 
Property / cites work: Poisson approximation for non-backtracking random walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4836494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4500512 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4693177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New upper bounds for the connective constants of self-avoiding walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-Backtracking Random Walks and Cogrowth of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved upper bounds for self-avoiding walks in \(\mathbb Z^d\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unlacing hypercube percolation: a survey / rank
 
Normal rank

Latest revision as of 06:36, 6 July 2024

scientific article
Language Label Description Also known as
English
Non-backtracking random walk
scientific article

    Statements

    Non-backtracking random walk (English)
    0 references
    0 references
    0 references
    18 March 2013
    0 references
    simple random walk
    0 references
    non-backtracking random walk
    0 references
    eigensystem
    0 references
    mixing time
    0 references
    central limit theorem
    0 references

    Identifiers

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