The maximum relaxation time of a random walk (Q1795486): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Graphs of given order and size and minimum algebraic connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum hitting time for random walks on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collisions Among Random Walks on a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremizing algebraic connectivity subject to graph theoretic constraints / 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: Collecting coupons on trees, and the cover time of random walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Effective Resistance of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for eigenvalues of certain stochastic matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4595047 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Extremal Markov Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5746814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Editor's Corner: The White Screen Problem / rank
 
Normal rank

Latest revision as of 22:46, 16 July 2024

scientific article
Language Label Description Also known as
English
The maximum relaxation time of a random walk
scientific article

    Statements

    Identifiers

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