Recurrent graphs where two independent random walks collide finitely often (Q1768221): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Importer (talk | contribs)
Changed an Item
 
Property / arXiv ID
 
Property / arXiv ID: math/0406487 / rank
 
Normal rank

Latest revision as of 22:58, 18 April 2024

scientific article
Language Label Description Also known as
English
Recurrent graphs where two independent random walks collide finitely often
scientific article

    Statements

    Recurrent graphs where two independent random walks collide finitely often (English)
    0 references
    0 references
    0 references
    0 references
    14 March 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    comb lattice
    0 references
    collisions
    0 references
    0 references