Random walks on edge transitive graphs (Q1382191): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Hitting times for random walks on vertex-transitive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex and Edge Transitive, but not 1-Transitive, Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692391 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks on highly symmetric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3706275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight upper bound on the cover time for random walks on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular line-symmetric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cover time of random walks on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering problems for Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Result of Aleliunas <i>et al.</i> Concerning Random Walks on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expected cover times of random walks on symmetric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks and the effective resistance of networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks on the triangular prism and other vertex-transitive graphs / rank
 
Normal rank

Revision as of 10:46, 28 May 2024

scientific article
Language Label Description Also known as
English
Random walks on edge transitive graphs
scientific article

    Statements

    Random walks on edge transitive graphs (English)
    0 references
    0 references
    0 references
    24 November 1998
    0 references
    The authors find explicit values for the expected hitting times between neighboring vertices of random walks on edge-transitive graphs, extending some results obtained by van Slijpe (1986), Aldous (1989), Devroye and Sbihi (1990) and Palacios (1992).
    0 references
    edge-transitive graphs
    0 references
    cover times
    0 references
    effective resistance
    0 references
    expected hitting times
    0 references
    0 references

    Identifiers