Bounds on expected hitting times for a random walk on a connected graph (Q922556): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0024-3795(90)90321-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2071531804 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3849175 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3254327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the spectral radius of graphs with e edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expected hitting times for a random walk on a connected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-negative matrices and Markov chains. 2nd ed / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound on the spectral radius of graphs / rank
 
Normal rank

Latest revision as of 11:43, 21 June 2024

scientific article
Language Label Description Also known as
English
Bounds on expected hitting times for a random walk on a connected graph
scientific article

    Statements

    Bounds on expected hitting times for a random walk on a connected graph (English)
    0 references
    1990
    0 references
    0 references
    0 references
    0 references
    0 references
    random walk
    0 references
    connected graph
    0 references
    maximum expected number of steps to get from one vertex to another
    0 references
    expected hitting times
    0 references
    0 references